function confirmModerate(url,num,pid){ url = url + '?Comments[do]=mod&Comments[pid]=' + pid + '&Comments[id]=' + num + '#Comments_' + num; if (confirm('Do you want to report this comment as inappropriate?')) location.href=url; return 0; } function validate_form(frm) { var value = ''; var errFlag = new Array(); _qfMsg = ''; value = frm.elements['Comments[name]'].value; if (value == '' && !errFlag['name']) { errFlag['name'] = true; _qfMsg = _qfMsg + '\n - Please enter your name'; } value = frm.elements['Comments[captcha]'].value; if (value == '' && !errFlag['captcha']) { errFlag['captcha'] = true; _qfMsg = _qfMsg + '\n - Please enter Security Code'; } value = frm.elements['Comments[mail]'].value; if (value == '' && !errFlag['mail']) { errFlag['mail'] = true; _qfMsg = _qfMsg + '\n - Please enter your e-mail'; } var regex = /^((\"[^\"\f\n\r\t\v\b]+\")|([\w\!\#\$\%\&'\*\+\-\~\/\^\`\|\{\}]+(\.[\w\!\#\$\%\&'\*\+\-\~\/\^\`\|\{\}]+)*))@((\[(((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9])))\])|(((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9])))|((([A-Za-z0-9\-])+\.)+[A-Za-z\-]+))$/; if (value != '' &&!regex.test(value) && !errFlag['mail']) { errFlag['mail'] = true; _qfMsg = _qfMsg + '\n - E-mail address format is invalid'; } value = frm.elements['Comments[text]'].value; if (value == '' && !errFlag['text']) { errFlag['text'] = true; _qfMsg = _qfMsg + '\n - Please enter your comment'; } if (value.length<50 && !errFlag['text']) { errFlag['text'] = true; _qfMsg = _qfMsg + '\n - Comment is too short (50 characters min.)'; } if (value.length>4000 && !errFlag['text']) { errFlag['text'] = true; _qfMsg = _qfMsg + '\n - Comment is too long (4000 characters max)'; } if (_qfMsg != '') { _qfMsg = 'Invalid information entered:' + _qfMsg + '\nPlease correct these fields.'; alert(_qfMsg); return false; } return true; } //]]>

On not-first/not-last conditions in disjunctive scheduling

Article Abstract:

Research is presented describing the study of disjunctive scheduling using the not-first/not-last task completion problem as a basis for the development of a constraint propagation algorithm.

Author: torres, P, Lopez, P

Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000

User Contributions:

Comment about this article or add new information about this topic:

Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem

Article Abstract:

Research is presented describing the study of project scheduling on resource constrained schemes using heuristical based programming to evaluate problem solving.

Author: Hartmann, S, Kolisch, R

Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000

Heuristic programming

User Contributions:

Comment about this article or add new information about this topic:

Subjects list: Operations research, Research, Management science, Study and teaching, Scheduling (Management)

Similar abstracts:

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.