A cutting plane approach for the multi-machine precedence-constrained scheduling problem
- 31 Downloads
A cutting-plane approach is developed for the problem of optimally scheduling jobs with arbitrary precedence constraints on unrelated parallel machines to minimize weighted completion time. While the single machine version of this problem has attracted much research efforts, enabling solving problems with up to 100 jobs, not much has been done on the multiple machines case. A novel mixed-integer programming model is presented for the problem with multiple machines. For this model, many classes of valid inequalities that cut off fractional linear programming solutions are developed. This leads to an increase of the linear programming lower bound from 89.3 to 94.6% of the corresponding optimal solution, and a substantial reduction in the computational time of an optimal branch-and-bound algorithm for this problem. This enables us to report optimal solutions for problem instances with up to 25 jobs and 5 machines, which is more than twice the size of problems for which optimal solutions have been reported in the literature thus far. For a special case of the problem—that of minimizing makespan—application of our model helps solve 18 of 27 previously unsolved problem instances to optimality.
KeywordsUnrelated machine scheduling Precedence-constrained scheduling Optimization Integer programming Valid inequalities
The authors would like to thank the authors of Coll et al. (2006) for sharing problem instances reported in their work. All of the problem instances on which solutions have been reported in our paper have been made available as an online supplement. We also thank the editor and the two anonymous referees whose comments helped improve the contribution of the paper.
- Hassan, M. A., Kacem, I., Martin, S., & Osman, I. M. (2016). Unrelated parallel machine scheduling problem with precedence constraints: Polyhedral analysis and branch-and-cut. In Combinatorial optimization: 4th international symposium (Vol. ISCO, pp. 308–319).Google Scholar
- Liu, C. (2013). A hybrid genetic algorithm to minimize total tardiness for unrelated parallel machine scheduling with precedence constraints. Mathematical Problems in Engineering. Article ID 537127Google Scholar
- Mokotoff, E. (2001). Parallel machine scheduling problems: A survey. Asia-Pacific Journal of Operational Research, 18(2), 193–242.Google Scholar
- Schulz, A. S. (1995). Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds. In International conference on integer programming and combinatorial optimization. Springer, Berlin.Google Scholar
- Szmerekovsky, J. G. (2003). Maximizing project net-present value and minimizing work-in-progress costs in projects. Cleveland, OH: Case Western Reserve University.Google Scholar
- Tavakkoli-Moghaddan, R., Taheri, F., Bazzazi, M., Izadi, M., & Sassani, F. (2009). Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Computers and Operations Research, 36, 3224–3230.CrossRefGoogle Scholar
- Woo, Y.-B., Jung, S., & Kim, B. S. (2017). A rule-based genetic algorithm with an improvement heuristic for unrelated parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities. Computers and Industrial Engineering, 109, 179–190.CrossRefGoogle Scholar