References
- Adamopoulos, G., and C. Pappis. 1998. “Scheduling Under a Common Due-data on Parallel Unrelated Machines.” European Journal of Operational Research 105 (3): 494–501.
- Benders, J. F. 1962. “Partitioning Procedures for Solving Mixed-variables Programming Problems.” Numerische Mathematik 4: 238–252.
- Bilyk, A., and L. Mönch. 2012. “A Variable Neighborhood Search Approach for Planning and Scheduling of Jobs on Unrelated Parallel Machines.” Journal of Intelligent Manufacturing 23: 1621–1635.
- Brucker, P. 1999. Scheduling Algorithms. Berlin: Springer.
- Chen, J. F. 2009. “Scheduling on Unrelated Parallel Machines with Sequence- and Machine-dependent Setup Times and Due-date Constraints.” The International Journal of Advanced Manufacturing Technology 44: 1204–1212.
- Correa, J., A. Marchetti-Spaccamela, J. Matuschke, L. Stougie, O. Svensson, V. Verdugo, and J. Verschae. 2015. “Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines.” Mathematical Programming 154: 305–328.
- Correa, J., V. Verdugo, and J. Verschae. 2016. “Splitting Versus Setup Trade-offs for Scheduling to Minimize Weighted Completion Time.” Operations Research Letters 44 (4): 469–473.
- CPLEX. 2022. “IBM ILOG CPLEX Optimization Studio CPLEX User's Manual.” Version 12 Release 8, Starting from a solution: MIP starts. https://www.ibm.com/docs/en/SSSA5P_12.8.0/ilog.odms.studio.help/pdf/usrcplex.pdf, 255–260.
- Dell'Amico, M., M. Iori, S. Martello, and M. Monaci. 2008. “Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem.” INFORMS Journal on Computing 20 (3): 333–344.
- Dessouky, M., B. Lageweg, J. Lenstra, and S. van de Velde. 1990. “Scheduling Identical Jobs on Uniform Parallel Machines.” Statistica Neerlandica 44 (3): 115–123.
- Eirinakis, P., G. Kasapidis, I. Mourtos, P. Repoussis, and E. Zampou. 2021. “Situation-aware Manufacturing Systems for Capturing and Handling Disruptions.” Journal of Manufacturing Systems58: 365–383.
- Emmons, H. 1987. “Scheduling to a Common Due Date on Parallel Uniform Processors.” Naval Research Logistics 34 (6): 803–810.
- Eroglu, D. Y., and H. C. Ozmutlu. 2017. “Solution Method for a Large-scale Loom Scheduling Problem with Machine Eligibility and Splitting Property.” The Journal of the Textile Institute 108 (12): 2154–2165.
- Eroglu, D. Y., H. C. Ozmutlu, and S. Ozmutlu. 2014. “Genetic Algorithm with Local Search for the Unrelated Parallel Machine Scheduling Problem with Sequence-dependent Setup Times.” International Journal of Production Research 52 (19): 5841–5856.
- Fleszar, K., and K. S. Hindi. 2018. “Algorithms for the Unrelated Parallel Machine Scheduling Problem with a Resource Constraint.” European Journal of Operational Research 271 (3): 839–848.
- Fotakis, D., J. Matuschke, and O. Papadigenopoulos. 2020. “Malleable Scheduling Beyond Identical Machines.” https://arxiv.org/abs/1903.11016.
- Fotakis, D., I. Milis, O. Papadigenopoulos, V. Vassalos, and G. Zois. 2016. “Scheduling MapReduce Jobs on Identical and Unrelated Processors.” Theory of Computing Systems 64 (5): 754–782.
- Gokhale, R., and M. Mathirajan. 2012. “Scheduling Identical Parallel Machines with Machine Eligibility Restrictions to Minimize Total Weighted Flowtime in Automobile Gear Manufacturing.” International Journal of Advanced Manufacturing Technology 60: 1099–1110.
- GUROBI. 2022. “Gurobi Optimization.” https://www.gurobi.com/.
- Hall, N. G., C. N. Potts, and C. Sriskandarajah. 2000. “Parallel Machine Scheduling with a Common Server.” Discrete Applied Mathematics 102 (3): 223–243.
- Hamzadayi, A., and G. Yildiz. 2017. “Modeling and Solving Static M Identical Parallel Machines Scheduling Problem with a Common Server and Sequence Dependent Setup Times.” Computers and Industrial Engineering 106: 287–298.
- Hong, J., K. Moon, K. Lee, K. Lee, and M. Pinedo. 2022. “An Iterated Greedy Matheuristic for Scheduling in Steelmaking-continuous Casting Process.” International Journal of Production Research 60 (2): 623–643.
- Hooker, J. N. 2007. “Planning and Scheduling by Logic-based Benders Decomposition.” Operations Research 55 (3): 588–602.
- Hooker, J. N., and G. Ottosson. 2003. “Logic-based Benders Decomposition.” Mathematical Programming96: 33–60.
- IBM. 2022. “IBM ILOG CPLEX Optimizer.” https://www.ibm.com/analytics/cplex-optimizer.
- Kim, J., and H. J. Kim. 2020a. “Parallel Machine Scheduling with Multiple Processing Alternatives and Sequence-dependent Setup Times.” International Journal of Production Research 59 (18): 5438–5453.
- Kim, J., and H. J. Kim. 2020b. “Rescheduling of Unrelated Parallel Machines with Job-dependent Setup Times Under Forecasted Machine Breakdown.” International Journal of Production Research 59 (17): 5236–5258.
- Kim, H. J., and J. H. Lee. 2021. “Scheduling Uniform Parallel Dedicated Machines with Job Splitting, Sequence-dependent Setup Times, and Multiple Servers.” Computers & Operations Research 126. Article ID 105115. doi:10.1016/j.cor.2020.105115.
- Kim, Y. D., S. O. Shim, S. B. Kim, Y. C. Choi, and H. M. Yoon. 2004. “Parallel Machine Scheduling Considering a Job-splitting Property.” International Journal of Production Research 42 (21): 4531–4546.
- Kim, J., S. Song, and B. Jeong. 2020. “Minimising Total Tardiness for the Identical Parallel Machine Scheduling Problem with Splitting Jobs and Sequence-dependent Setup Times.” International Journal of Production Research 58 (6): 1628–1643.
- Lam, E., G. Gange, P. J. Stuckey, P. Van Hentenryck, and J. J. Dekker. 2020. “Nutmeg: a MIP and CP Hybrid Solver Using Branch-and-Check.” SN Operations Research Forum 1 (22): 1–22.
- Lee, J. H., H. Hoon Jang, and H. J. Kim. 2021. “Iterative Job Splitting Algorithms for Parallel Machine Scheduling with Job Splitting and Setup Resource Constraints.” Journal of the Operational Research Society 72 (4): 780–799.
- Lei, D., Y. Yuan, and J. Cai. 2021. “An Improved Artificial Bee Colony for Multi-objective Distributed Unrelated Parallel Machine Scheduling.” International Journal of Production Research 59 (17): 5259–5271.
- Lenstra, J. K., D. B. Shmoys, and E. Tardos. 1990. “Approximation Algorithms for Scheduling Unrelated Parallel Machines.” Mathematical Programming 46: 259–271.
- Letsios, D., J. T. Bradley, G. Suraj, R. Misener, and N. Page. 2021. “Approximate and Robust Bounded Job Start Scheduling for Royal Mail Delivery Offices.” Journal of Scheduling 24: 1–22.
- Li, Y., J-F. Cote, L. Coelho, and P. Wu. 2021. “Novel Efficient Formulation and Matheuristic for Large-sized Unrelated Parallel Machine Scheduling with Release Dates.” International Journal of Production Research. doi:10.1080/00207543.2021.1983224.
- Li, Y., X. Li, L. Gao, B. Zhang, Q. Pan, F. Tasgetiren, and L. Meng. 2021. “A Discrete Artificial Bee Colony Algorithm for Distributed Hybrid Flowshop Scheduling Problem with Sequence-dependent Setup Times.” International Journal of Production Research 59 (13): 3880–3899.
- Liu, X., F. Chu, F. Zheng, C. Chu, and M. Liu. 2021. “Parallel Machine Scheduling with Stochastic Release Times and Processing Times.” International Journal of Production Research 59 (20): 6327–6346.
- Logendran, R., and F. Subur. 2004. “Unrelated Parallel Machine Scheduling with Job Splitting.” IIE Transactions 36 (4): 359–372. doi:10.1080/07408170490279598.
- Miller, C. E., A. W. Tucker, and R. A. Zemlin. 1960. “Integer Programming Formulation of Traveling Salesman Problems.” Journal of the ACM 7 (4): 326–329.
- Min, L., and W. Cheng. 1999. “A Genetic Algorithm for Minimizing the Makespan in the Case of Scheduling Identical Parallel Machines.” Artificial Intelligence in Engineering 13 (4): 399–403.
- Mokotoff, E. 2004. “An Exact Algorithm for the Identical Parallel Machine Scheduling Problem.” European Journal of Operational Research 152 (3): 758–769.
- Mourtos, I., S. Vatikiotis, and G. Zois. 2021. “Scheduling Jobs on Unrelated Machines with Job Splitting and Setup Resource Constraints for Weaving in Textile Manufacturing.” APMS 2021: Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 424–434.
- Peyro, L. F. 2020. “Models and An Exact Method for the Unrelated Parallel Machine Scheduling Problem with Setups and Resources.” Expert Systems with Applications: X 5: 1–15.
- Peyro, L. F., R. Ruiz, and F. Perea. 2019. “Reformulations and An Exact Algorithm for Unrelated Parallel Machine Scheduling Problems with Setup Times.” Computers & Operations Research 81: 173–182.
- Pimentel, C., F. Alvelos, A. Duarte, and J. Carvalho. 2011. “Exact and Heuristic Approaches for Lot Splitting and Scheduling on Identical Parallel Machine.” International Journal of Manufacturing Technology and Management 22 (1): 39–57.
- Ren, W., J. Wen, Y. Yan, Y. Hu, Y. Guan, and J. Li. 2021. “Multi-objective Optimisation for Energy-aware Flexible Job-shop Scheduling Problem with Assembly Operations.” International Journal of Production Research 59 (23): 7216–7231.
- Roberti, R., and P. Toth. 2012. “Models and Algorithms for the Asymmetric Traveling Salesman Problem: An Experimental Comparison.” EURO Journal on Transportation and Logistics 1: 113–133.
- Rosales, O. A., F. A. Bello, and A. Alvarez. 2015. “Efficient Metaheuristic Algorithm and Re-formulations for the Unrelated Parallel Machine Scheduling Problem with Sequence and Machine-dependent Setup Times.” The International Journal of Advanced Manufacturing Technology 76: 1705–1718.
- Salah, E., and S. H. Elmaghraby Park. 1974. “Scheduling Jobs on a Number of Identical Machines.” A I I E Transactions 6 (1): 1–13.
- Serafini, P. 1996. “Scheduling Jobs on Several Machines with Job Splitting Property.” INFORMS Operations Research 44 (4): 531–659.
- Silva, C., and J. M. Magalhaes. 2006. “Heuristic Lot Size Scheduling on Unrelated Parallel Machines with Applications in the Textile Industry.” Computers & Industrial Engineering 50: 76–89.
- Tran, T. T., A. Araujo, and J. C. Beck. 2016. “Decomposition Methods for the Parallel Machine Scheduling Problem with Setups.” INFORMS Journal on Computing 28: 83–95.
- Vallada, E., and R. Ruiz. 2011. “A Genetic Algorithm for the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Time.” European Journal of Operational Research 211 (3): 612–622.
- Wang, S., X. Wang, J. Yu, S. Ma, and M. Liu. 2018. “Bi-objective Identical Parallel Machine Scheduling to Minimize Total Energy Consumption and Makespan.” Journal of Cleaner Production 193: 424–440.
- Werner, F., and S. A. Kravchenko. 2010. “Scheduling with Multiple Servers.” Automation and Remote Control 71: 2109–2121.
- Yalaoui, F., and C. Chu. 2003. “An Efficient Heuristic Approach for Parallel Machine Scheduling with Job Splitting and Sequence-dependent Setup Times.” IIE Transactions 35 (2): 183–190.
- Yu, L., H. M. Shih, M. Pfund, W. M. Carlyle, and J. W. Fowler. 2002. “Scheduling of Unrelated Parallel Machines: An Application to PWB Manufacturing.” IIE Transactions 34: 921–931.
- Yunusoglu, P., and S. T. Yildiz. 2021. “Constraint Programming Approach for Multi-resource-constrained Unrelated Parallel Machine Scheduling Problem with Sequence-dependent Setup Times.” International Journal of Production Research 60 (7): 2212–2229.