# A cutting plane approach for the multi-machine precedence-constrained scheduling problem

- 31 Downloads

## Abstract

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.

## Keywords

Unrelated machine scheduling Precedence-constrained scheduling Optimization Integer programming Valid inequalities## Notes

### Acknowledgements

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.

## References

- Afzairad, M., & Rezaeian, J. (2016). Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions.
*Computers and Industrial Engineering*,*98*, 40–52.CrossRefGoogle Scholar - Agarwal, Y. K. (2018). Network loading problem: Valid inequalities from 5-and higher partitions.
*Computers and Operations Research*,*99*, 123–134.CrossRefGoogle Scholar - Arroyo, J. E. C., & Leung, J. Y.-T. (2017a). An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times.
*Computers and Industrial Engineering*,*105*, 84–100.CrossRefGoogle Scholar - Arroyo, J. E. C., & Leung, J. Y.-T. (2017b). Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times.
*Computers and Operations Research*,*78*, 117–128.CrossRefGoogle Scholar - Balas, E. (1985). On the facial structure of scheduling polyhedra.
*Mathematical Programming Study*,*24*, 179–218.CrossRefGoogle Scholar - Che, A., Zhang, S., & Wu, X. (2017). Energy-conscious unrelated parallel machine scheduling under time-of-use electricity tariffs.
*Journal of Cleaner Production*,*156*, 688–697.CrossRefGoogle Scholar - Chen, Z.-L., & Powell, W. B. (1999). Solving parallel machine scheduling problems by column generation.
*INFORMS Journal on Computing*,*11*(1), 78–94.CrossRefGoogle Scholar - Cheng, C.-Y., & Huang, L. W. (2017). Minimizing total earliness and tardiness through unrelated parallel machine scheduling using distributed release time control.
*Journal of Manufacturing Systems*,*42*, 1–10.CrossRefGoogle Scholar - Coll, P. E., Ribeiro, C. C., & de Souza, C. C. (2006). Multiprocessor scheduling under precedence constraints: Polyhedral results.
*Discrete Applied Mathematics*,*154*, 770–801.CrossRefGoogle Scholar - Correia, I., Lourenço, L. L., & Saldanha-da-Gama, F. (2012). Project scheduling with flexible resources: Formulation and inequalities.
*OR Spectrum*,*34*, 635–663.CrossRefGoogle Scholar - de Farias Jr, I. R., Zhoa, H., & Zhao, M. (2010). A family of inequalities valid for the robust single machine scheduling polyhedron.
*Computers and Operations Research*,*37*, 1610–1614.CrossRefGoogle Scholar - Dyer, M. E., & Wolsey, L. A. (1990). Formulating the single machine sequencing problem with release dates as a mixed integer program.
*Discrete Applied Mathematics*,*26*, 255–270.CrossRefGoogle Scholar - Fanjul-Peyro, L., Perea, F., & Ruiz, R. (2017). Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources.
*European Journal of Operatonal Research*,*260*, 482–493.CrossRefGoogle Scholar - Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnoy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey.
*Annals of Discrete Mathematics*,*5*, 287–326.CrossRefGoogle Scholar - 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 - Herrmann, J., Proth, J.-M., & Sauer, N. (1997). Heuristics for unrelated machine scheduling with precedence constraints.
*European Journal of Operational Research*,*102*, 528–537.CrossRefGoogle Scholar - Joo, C. M., & Kim, B. S. (2017). Rule-based meta-heuristics for integrated scheduling of unrelated parallel machines, batches, and heterogeneous delivery trucks.
*Applied Soft Computing*,*53*, 457–476.CrossRefGoogle Scholar - Kolisch, R., & Sprecher, A. (1997). PSPLIB-a project scheduling problem library: OR software-ORSEP operations research software exchange program.
*European Journal of Operational Research*,*96*(1), 205–216.CrossRefGoogle Scholar - Kumar, V. S. A., Marathe, M. V., Parthasarathy, S., & Srinivasan, A. (2009). Scheduling on unrelated machines under tree-like precedence constraints.
*Algorithmica*,*55*, 205–226.CrossRefGoogle 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 - Liu, C., & Yang, S. (2011). A heuristic serial schedule algorithm for unrelated parallel machine scheduling with precedence constraints.
*Journal of Software*,*6*(6), 1146–1153.CrossRefGoogle Scholar - Mokotoff, E. (2001). Parallel machine scheduling problems: A survey.
*Asia-Pacific Journal of Operational Research*,*18*(2), 193–242.Google Scholar - Mokotoff, E. (2004). An exact algorithm for the identical parallel machine scheduling problem.
*European Journal of Operational Research*,*152.3*(2004), 758–769.CrossRefGoogle Scholar - Mokotoff, E., & Chrétienne, P. (2002). A cutting plane algorithm for the unrelated parallel machine scheduling problem.
*European Journal of Operational Research*,*141*, 515–525.CrossRefGoogle Scholar - Nishi, T., & Hiranaka, Y. (2013). Lagrangian relaxation and cut generation for sequence-dependent setup time flowshop scheduling problems to minimise the total weighted tardiness.
*International Journal of Production Research*,*51*(16), 4778–4796.CrossRefGoogle Scholar - Nishi, T., Hiranaka, Y., & Inuiguchi, M. (2010). Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness.
*Computers and Operations Research*,*37*, 189–198.CrossRefGoogle Scholar - Olaguíel, R. S.-V., & Goerlich, J. M. T. (1993). The project scheduling polyhedron: Dimension, facets, and lifting theorems.
*European Journal of Operational Research*,*67*, 204–220.CrossRefGoogle Scholar - Potts, C. N. (1985). A Lagrangean based branch and bound algorithm for single machine sequencing with precedence constraints to minimize total weighted completion time.
*Management Science*,*31*(10), 1300–1311.CrossRefGoogle Scholar - Queyranne, M. (1993). Structure of a simple scheduling polyhedron.
*Mathematical Programming*,*58*, 263–285.CrossRefGoogle Scholar - Queyranne, M., & Wang, Y. (1991). Single-machine scheduling polyhedra with precedence constraints.
*Mathematics of Operations Research*,*16*(1), 1–20.CrossRefGoogle 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 - Shahvari, O., & Logendran, R. (2017). An Enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes.
*Computers and Operations Research*,*77*, 154–176.CrossRefGoogle Scholar - Sitters, R. (2017). Approximability of average completion time scheduling on unrelated machines.
*Mathematical Programming Series A*,*161*, 135–158.CrossRefGoogle Scholar - Smith, W. E. (1956). Various optimizer for single-stage production.
*Naval Research Logistics Quarterly*,*3*, 59–66.CrossRefGoogle Scholar - Šorić, K. (2000). A cutting plane algorithm for a single machine scheduling problem.
*European Journal of Operational Research*,*127*, 383–393.CrossRefGoogle 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