Ordered minimum completion time heuristic for unrelated parallel-machines problems

Scheduling problems in parallel machines have been deeply studied and many are too complex to be solved by exact methods. The unrelated parallel machines makespan minimization problem (Rm||Cmax) is known to be NP-hard and is usually solved using heuristics. Considering heuristics used in these problems, it is possible to identify two different approaches, those that use the execution time to allocate tasks and those that use the completion time. This paper proposes a new heuristic, OMCT (Ordered Minimum Completion Time), based on the performance limitation of the MCT (Minimum Completion Time). The computational study results demonstrate the effectiveness of the proposed heuristic.

[1]  Fatos Xhafa,et al.  Metaheuristics for Scheduling in Industrial and Manufacturing Applications , 2008, Metaheuristics for Scheduling in Industrial and Manufacturing Applications.

[2]  Anthony A. Maciejewski,et al.  Characterization of the iterative application of makespan heuristics on non-makespan machines in a heterogeneous parallel and distributed environment , 2011, The Journal of Supercomputing.

[3]  Kenneth R. Baker,et al.  Principles of Sequencing and Scheduling. New York: John Wiley & Sons , 2009 .

[4]  Panneerselvam Sivasankaran,et al.  Efficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines , 2010, Intell. Inf. Manag..

[5]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[6]  André Borges Guimarães Serra e Santos.  Afetação de recursos em sistemas de produção , 2013 .

[7]  John W. Fowler,et al.  A SURVEY OF ALGORITHMS FOR SINGLE AND MULTI-OBJECTIVE UNRELATED PARALLEL-MACHINE DETERMINISTIC SCHEDULING PROBLEMS , 2004 .

[8]  Chris N. Potts,et al.  Heuristics for scheduling unrelated parallel machines , 1991, Comput. Oper. Res..

[9]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[10]  Anthony A. Maciejewski,et al.  Robust static allocation of resources for independent tasks under makespan and dollar cost constraints , 2007, J. Parallel Distributed Comput..

[11]  Manpreet Singh,et al.  Heuristic Based Task Scheduling In Grid , 2012 .

[12]  Oscar H. Ibarra,et al.  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.