Dispatching rules for unrelated parallel machine scheduling with release dates


DOI: 10.1007/s00170-013-4773-8

Cite this article as:
Yang-Kuei, L. & Chi-Wei, L. Int J Adv Manuf Technol (2013) 67: 269. doi:10.1007/s00170-013-4773-8


In this research, we consider the problem of scheduling n jobs on m unrelated parallel machines with release dates to minimize makespan, total weighted completion time, and total weighted tardiness, individually. The problem is NP-hard in the strong sense. We develop several mixed integer programming models for these scheduling problems to find the optimal solutions for small problem instances. We also propose several dispatching rules to find good solutions quickly for large problem instances. We compare our proposed dispatching rules with other existing dispatching rules. Computational results show that the proposed dispatching rules outperform other existing dispatching rules for problem instances of all sizes.

Keywords Scheduling Unrelated parallel machines Release date Dispatching rule 

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  1. 1.Department of Industrial Engineering and Systems ManagementFeng Chia UniversityTaichungTaiwan

Personalised recommendations