A GRASP for a real-world scheduling problem with unrelated parallel print machines and sequence-dependent setup times

References

• Allahverdi, A. 2015. “The Third Comprehensive Survey on Scheduling Problems with Setup Times/costs.” European Journal of Operational Research 246 (2): 345–378.
   Web of Science ®Google Scholar
• Allahverdi, A. 2016. “A Survey of Scheduling Problems with No-wait in Process.” European Journal of Operational Research 255 (3): 665–686.
   Web of Science ®Google Scholar
• Allahverdi, A., C. Ng, T. Cheng, and M. Kovalyov. 2008. “A Survey of Scheduling Problems with Setup Times Or Costs.” European Journal of Operational Research 187 (3): 985–1032.
   Web of Science ®Google Scholar
• Burger, A., C. Jacobs, J. Van Vuuren, and S. Visagie. 2015. “Scheduling Multi-colour Print Jobs with Sequence-dependent Setup Times.” Journal of Scheduling 18 (2): 131–145.
   Web of Science ®Google Scholar
• Calmels, D. 2019. “The Job Sequencing and Tool Switching Problem: State-of-the-art Literature Review, Classification, and Trends.” International Journal of Production Research 57 (15-16): 5005–5025.
   Web of Science ®Google Scholar
• Calmels, D. 2022. “An Iterated Local Search Procedure for the Job Sequencing and Tool Switching Problem with Non-identical Parallel Machines.” European Journal of Operational Research 297 (1): 66–85.
   Web of Science ®Google Scholar
• Crama, Y. 1997. “Combinatorial Optimization Models for Production Scheduling in Automated Manufacturing Systems.” European Journal of Operational Research 99 (1): 136–153.
   Web of Science ®Google Scholar
• Crama, Y., A. Kolen, A. Oerlemans, and F. Spieksma. 1994. “Minimizing the Number of Tool Switches on a Flexible Machine.” International Journal of Flexible Manufacturing Systems 6 (1): 33–54.
   Google Scholar
• Crama, Y., L. S. Moonen, F. Spieksma, and E. Talloen. 2007. “The Tool Switching Problem Revisited.” European Journal of Operational Research 182 (2): 952–957.
   Web of Science ®Google Scholar
• Dayama, N., M. Krishnamoorthy, A. Ernst, N. Rangaraj, and V. Narayanan. 2015. “History-dependent Scheduling: Models and Algorithms for Scheduling with General Precedence and Sequence Dependence.” Computers and Operations Research 64: 245–261.
   Web of Science ®Google Scholar
• Durasević, M., and D. Jakobović. 2021. “Heuristic and Metaheuristic Methods for the Unrelated Machines Scheduling Problem: A Survey.” arXiv: 2107.13106.
   Google Scholar
• Ehrgott, M. 2005. Multicriteria Optimization, Vol. 491. Berlin: Springer.
   Google Scholar
• Graham, R., E. Lawler, J. Lenstra, and A. Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326.
   Google Scholar
• Huang, X., L. Chen, Y. Zhang, S. Su, Y. Lin, and X. Cao. 2022. “Improved Firefly Algorithm with Courtship Learning for Unrelated Parallel Machine Scheduling Problem with Sequence-dependent Setup Times.” Journal of Cloud Computing 11: 1–17.
   Google Scholar
• Iori, M., A. Locatelli, and M. Locatelli. 2021. “Scheduling of parallel print machines with sequence-dependent setup costs: A real-world case study.” In IFIP International Conference on Advances in Production Management Systems, 637–645. Springer.
   Google Scholar
• Iori, M., A. Locatelli, M. Locatelli, and J. J. Salazar-González. “Tool switching problems in the context of overlay printing with multiple colours.” In International Symposium on Combinatorial Optimization, (in press 2022).
   Google Scholar
• Jovanovic, R., A. P. Sanfilippo, and S. Voß. 2022. “Fixed Set Search Applied to the Multi-objective Minimum Weighted Vertex Cover Problem.” Journal of Heuristics 28 (4): 481–508.
   Web of Science ®Google Scholar
• Jovanovic, R., and S. Voß. 2021. “Fixed Set Search Application for Minimizing the Makespan on Unrelated Parallel Machines with Sequence-dependent Setup Times.” Applied Soft Computing 110: 107521.
   Web of Science ®Google Scholar
• Kipphan, H. 2001. Handbook of Print Media: technologies and production methods. Berlin: Springer Science & Business Media.
   Google Scholar
• Laporte, G., J. Salazar-González, and F. Semet. 2004. “Exact Algorithms for the Job Sequencing and Tool Switching Problem.” IIE Transactions 36 (1): 37–45.
   Web of Science ®Google Scholar
• Lee, K., L. Lei, and M. Pinedo. 2012. “Production Scheduling with History-dependent Setup Times.” Naval Research Logistics 59 (1): 58–68.
   Web of Science ®Google Scholar
• Mara, S. Windras, E. Sutoyo, R. Norcahyo, and A. Rifai. “The job sequencing and tool switching problem with sequence-dependent setup time.” Journal of King Saud University – Engineering Sciences, (in press 2021).
   Google Scholar
• Paine, F. A., and H. Y. Paine. 2012. A Handbook of Food Packaging. Boston, MA, USA: Springer.
   Google Scholar
• Privault, C., and G. Finke. 1995. “Modelling a Tool Switching Problem on a Single Nc-machine.” Journal of Intelligent Manufacturing 6 (2): 87–94.
   Web of Science ®Google Scholar
• Resende, M. G. C., and C. C. Ribeiro. 2019. “Greedy randomized adaptive search procedures: Advances and extensions.” In Handbook of metaheuristics, 169–220. Springer.
   Google Scholar
• Schuurman, J., and J. Van Vuuren. 2016. “Scheduling Sequence-dependent Colour Printing Jobs.” South African Journal of Industrial Engineering 27 (2): 43–59.
   Web of Science ®Google Scholar
• Tzur, M., and A. Altman. 2004. “Minimization of Tool Switches for a Flexible Manufacturing Machine with Slot Assignment of Different Tool Sizes.” IIE Transactions 36 (2): 95–110.
   Web of Science ®Google Scholar
• Van Hop, N. 2005. “The Tool-switching Problem with Magazine Capacity and Tool Size Constraints.” IEEE Transactions on Systems, Man, and Cybernetics 35 (5): 617–628.
   Web of Science ®Google Scholar
• Yunusoglu, P., and S. Topaloglu Yildiz. 2022. “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.
   Web of Science ®Google Scholar