Research Article
A Note on Multimachine Scheduling with Weighted Early/Late Work Criteria and Common Due Date
(1) | Reorder the jobs by nonincreasing order of their weights, i.e., ; | (2) | Enumerate all the possible partitions of the job set; | (3) | for each partition | (4) | do Keep the nonincreasing order of the jobs on each machine; | (5) | Calculate the criterion value for this schedule; | (6) | Output the best solution with the maximal criterion value; |
|