Article Contents
Article Contents

# Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration

• In this paper, we consider a non-preemptive task scheduling problem for unrelated parallel processors (UPP) with the objective of minimizing the makespan. We address priority consideration as an added feature to the basic task characteristics of UPP scheduling. A mixed integer linear programming model is developed to obtain an optimal solution for the problem. Computational testing is implemented using AIMMS 3.10 package and CPLEX 12.1 as the solver. Computational results show that the proposed MILP model is effective and produces optimal results with up to 100 tasks run on 5 processors with an average solution time of less than an hour.
Mathematics Subject Classification: Primary: 90C11, 90C27; Secondary: 90B35.

 Citation:

•  [1] Ali Allahverdi, C. T. Ng, T. C. E. Cheng and Mikhail Y. Kovalyov, A survey of scheduling problems with setup times or costs, European Journal of Operational Research, 187 (2008), 985-1032.doi: 10.1016/j.ejor.2006.06.060. [2] Georgios C. Anagnostopoulos and Ghaith Rabadi, A simulated annealing algorithm for the unrelated parallel machine scheduling problem, Proceedings of the 5th Biannual world automation congress, 14 (2002), 115-120. [3] Bjorn Andersson, Static-priority Scheduling on Multiprocessors, Ph. D thesis, Chalmers University of Technology in Goteborg, Sweden, 2003. [4] V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy and Aravind Srivivasan, Scheduling on unrelated machines under tree-like precedence constraints, Algorithmica, 55 (2005), 205-226.doi: 10.1007/s00453-007-9004-y. [5] Jacek Blazewicz, Moshe Dror and Jan Weglarz, Mathematical programming formulations for machine scheduling : A survey, European Journal of Operational Research, 51 (1991), 283-300. [6] Bo Chen, Chris N. Potts and Gerhard J. Woeginger, A review of machine scheduling: Complexity, algorithms and approximability, in Handbook of Combinatorial Optimization (Vol. 3) (eds. D.-Z. Du and P. M. Pardalos), Kluwer Academic Publishers, (1998), 21-169. [7] M. Ghirardi and C. N. Potts, Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach, European Journal of Operational Research, 165 (2005), 457-467. [8] C. A. Glass, C. N. Potts and P. Shade, Unrelated parallel machine scheduling using local search, Mathematical and Computer Modelling, 20 (1994), 41-52. [9] Valery Gordon, Jean-Marie Proth and Chengbin Chu, A survey of the state-of-the-art of common due date assignement and scheduling research, European Journal of Operational Research, 139 (2002), 1-25.doi: 10.1016/S0377-2217(01)00181-3. [10] R. L. Graham, E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics, 5 (1979), 287-326. [11] Alexander Grigoriev, Maxim Sviridenko and Marc Uetz, Unrelated parallel machine scheduling with resource dependent processing times, Lecture Notes in Computer Science, (2005), 182-192.doi: 10.1007/11496915_14. [12] Jeffrey Herrmann, Jean-Marie Proth and Nathalie Sauer, Heuristic for unrelated machine scheduling with presedence canstraint, European Journal of Operational Research, 102 (1997), 528-537. [13] Han Hoogeveen, Martin Skutella and Gerhard J. Woeginger, Mathematical Programming, European Journal of Operational Research, 94 (2003), 361-374.doi: 10.1007/s10107-002-0324-z. [14] Jan Karel Lenstra, David B Shmoys and Eva Tardos, Approximation algorithms for scheduling unrelated parallel machine, Mathematical Programming, 46 (1990), 259-271.doi: 10.1007/BF01585745. [15] Dong-Won Kim, Dong-Gil Na and F. Frank Chen, Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective, Robotics and Computer Integrated Manufacturing, 19 (2003), 173-181. [16] Antoon W. J. Kolen and Leo G. Kroon, On the computational complexity of (maximum) class scheduling, European Journal of Operational Research, 54 (2003), 23-38. [17] Lawler and Labetoulle, On preemtive scheduling of unrelated parallel processors by linear programming, Journal of the Association for Computing Machinery, 25 (1978), 621-619.doi: 10.1145/322092.322101. [18] Kai Li and Shan-lin Yang, Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Model, relaxations and algorithms, Applied mathematical Modelling, 33 (2009), 2145-2158.doi: 10.1016/j.apm.2008.05.019. [19] E. Mokotoff and J. L. Jimeno, Heuristic based on partial enumeration for the unrelated parallel processor scheduling problem, Annals of Operations Research, 117 (2002), 133-150.doi: 10.1023/A:1021569406280. [20] Silvano Martello, Francois Soumis and Paolo Toth, Exact and approximation algorithms for makespan minimization on unrelated parallel machine, Discrete Applied Mathematics, 75 (1997), 169-188.doi: 10.1016/S0166-218X(96)00087-X. [21] C. N. Potts, Analysis of a linear programming heuristic for scheduling unrelated parallel machines, Discrete Applied Mathematics, 10 (1985), 155-164.doi: 10.1016/0166-218X(85)90009-5. [22] David B. Shmoys and Eva Tardos, An approximation algorithm for the generalized assignment problem, Mathematical Programming, 62 (1993), 461-474.doi: 10.1007/BF01585178. [23] B. Srivastava, An effective heuristic for minimizing makespan on unrelated parallel processor, Journal of the Operational Research Society, 49 (1998), 886-894. [24] Yongzhong Wu and Ping Ji, A scheduling problem for PCB assembly: a case with multiple line, International Journal Advanced Technology, 43 (2009), 1189-1201. [25] L. Yu, H. M. Shih, M. Pfund, W. M. Carlyle and J. W. Fowler, Scheduling of unrelated parallel machines: an application to PWB manufacturing, IIE Transactions, 34 (2002), 921-931. [26] Vassilis E. Zafeiris and E. A. Giakoumakis, Towards flow scheduling optimization in multihomed mobile host, IEEE 19th International Symposium of Personal, Indoor and Mobile Radio Communication (PIMRC), (2008), 1-5.