Abstract
The job sequencing and tool switching problem (SSP) is an NP-hard combinatorial optimization problem in the context of flexible manufacturing machines. Tool switches denote the interchange of tools between the global tool storage and the local tool magazine of a machine since the tool magazine capacity of the machine is limited and cannot hold all tools necessary for processing all jobs. The presented work considers the SSP with non-identical parallel machines (SSP-NPM) for the different objectives minimizing the number of tool switches, minimizing makespan and minimizing total flowtime. A simple and fast heuristic approach for the SSP-NPM is presented that, step-by-step, assigns jobs to machines and, in the process, determines the loading of the tools. The performance of the heuristics is analyzed with respect to computation time and solution quality for different objectives.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Tang, C.S., Denardo, E.V.: Models arising from a flexible manufacturing machine, part i: minimization of the number of tool switches. Oper. Res. 36(5), 767–777 (1988)
Crama, Y., Kolen, A.W.J., Oerlemans, A.G., Spieksma, F.C.R.: Minimizing the number of tool switches on a flexible machine. Int. J. Flex. Manuf. Syst. 6(1), 33–54 (1994)
Bard, J.F.: A heuristic for minimizing the number of tool switches on a flexible machine. IIE Trans. 20(4), 382–391 (1988)
Fathi, Y., Barnette, K.W.: Heuristic procedures for the parallel machine problem with tool switches. Int. J. Prod. Res. 40(1), 151–164 (2002)
Sarmadi, H., Gholami, S.: Modeling of tool switching problem in a flexible manufacturing cell: with two or more machines. In: Lee, G. (ed.) International Conference on Mechanical and Electrical Technology, 3rd, (ICMET-London 2011), vol. 1–3, pp. 2345–2349. ASME, New York (2011)
Beezão, A.C., Cordeau, J.-F., Laporte, G., Yanasse, H.H.: Scheduling identical parallel machines with tooling constraints. Eur. J. Oper. Res. 257(3), 834–844 (2017)
Laporte, G., Salazar-González, J.J., Semet, F.: Exact algorithms for the job sequencing and tool switching problem. IIE Trans. 36(1), 37–45 (2004)
Özpeynirci, S., Gökgür, B., Hnich, B.: Parallel machine scheduling with tool loading. Appl. Math. Model. 40(9–10), 5660–5671 (2016)
Gökgür, B., Hnich, B., Özpeynirci, S.: Parallel machine scheduling with tool loading: a constraint programming approach. Int. J. Prod. Res. 56(16), 5541–5557 (2018)
Ghrayeb, O.A., Phojanamongkolkij, N., Finch, P.R.: A mathematical model and heuristic procedure to schedule printed circuit packs on sequencers. Int. J. Prod. Res. 41(16), 3849–3860 (2003)
Van Hop, N., Nagarur, N.N.: The scheduling problem of PCBs for multiple non-identical parallel machines. Eur. J. Oper. Res. 158(3), 577–594 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Calmels, D., Rajendran, C., Ziegler, H. (2019). Heuristics for Solving the Job Sequencing and Tool Switching Problem with Non-identical Parallel Machines. In: Fortz, B., Labbé, M. (eds) Operations Research Proceedings 2018. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-18500-8_57
Download citation
DOI: https://doi.org/10.1007/978-3-030-18500-8_57
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18499-5
Online ISBN: 978-3-030-18500-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)