|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| '''Lawler’s algorithm''' is a powerful technique for solving a variety of constrained scheduling problems.<ref>Steven Nahmias. Production and Operations Analysis. 2008. ISBN 978-0-07-126370-2</ref> The [[algorithm]] handles any precedence constraints. It schedules a set of simultaneously arriving tasks on one processor with precedence constraints to minimize maximum tardiness or lateness. Precedence constraints occur when certain jobs must be completed before other jobs can be started. | | Hello, I'm Loretta, a 30 year old from Garmisch-Partenkirchen, Germany.<br>My hobbies include (but are not limited to) Seashell Collecting, Antiquing and watching How I Met Your Mother.<br><br>My blog: [http://snakzstock.com/dressup4ever/profile/954402/LeJamar.html do my essay cheap] |
| | |
| ==Objective Functions==
| |
| The [[objective function]] is assumed to be in the form <math>min \, max_{0\le i \le n} \, g_i(F_i)</math>, where <math>g_i</math> is any [[nondecreasing function]] and <math>F_i</math> is the flow time.<ref>Joseph Y-T. Leung. Handbook of scheduling: algorithms, models, and performance analysis. 2004. ISBN 978-1-58488-397-5</ref> When <math>g_i (F_i) = F_i - d_i = L_i</math>, the objective function corresponds to minimizing the maximum lateness, where <math>d_i</math> is due time for job <math>i</math> and <math>L_i</math> lateness of job <math>i</math>. Another expression is <math>g_i (F_i) = max {(F_i-d_i,0)}</math>, which corresponds to minimizing the maximum tardiness.
| |
| | |
| ==References==
| |
| {{Reflist}}
| |
| | |
| ==Additional readings==
| |
| *Michael Pinedo. Scheduling: theory, algorithms, and systems. 2008. ISBN 978-0-387-78934-7
| |
| *Conway, Maxwell, Miller. Theory of Scheduling. 1967. ISBN 0-486-42817-6
| |
| | |
| [[Category:Production and manufacturing]]
| |
| [[Category:Operations research]]
| |
| [[Category:Industrial engineering]]
| |
Latest revision as of 12:03, 17 December 2014
Hello, I'm Loretta, a 30 year old from Garmisch-Partenkirchen, Germany.
My hobbies include (but are not limited to) Seashell Collecting, Antiquing and watching How I Met Your Mother.
My blog: do my essay cheap