Makespan minimization for m parallel identical processors

✍ Scribed by Johnny C. Ho; Johnny S. Wong

• Publisher: John Wiley and Sons
• Year: 1995
• Tongue: English
• Weight: 803 KB
• Volume: 42
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/1520-6750(199509)42:6<935::aid-nav3220420606>3.0.co;2-d

✦ Synopsis

We introduce an algorithm, called TMO (Two-Machine Optimal Scheduling) which minimizes the makespan for two identical processors. TMO employs lexicographic search in conjunction with the longest-processing time sequence to derive an optimal schedule. For the m identical parallel processors problem, we propose an improvement algorithm, which improves the seed solution obtained by any existing heuristic. The improvement algorithm, called Extended TMO, breaks the original m-machine problem into a set of two-machine problems and solves them repeatedly by the TMO. A simulation study is performed to evaluate the effectiveness of the proposed algorithms by comparing it against three existing heuristics: LPT (Graham, [ 1 I]), MULTIFIT (Coffman, Garey, and Johnson,), and RMG (Lee and Massey. [ 171). The simulation results show that: for the two processors case, the TMO performs significantly better than LPT, MULTIFIT, and RMG, and it generally takes considerably less CPU time than MULTIFIT and RMG. For the general parallel processors case, the Extended TMO algorithm is shown to be capable ofgreatly improving any seed solution.