Improved integer linear programming formulations for the job sequencing and tool switching problem

DOI10.1016/j.ejor.2015.02.018zbMath1348.90485OpenAlexW2084506151MaRDI QIDQ319452

Daniele Catanzaro, Luís Gouveia, Martine Labbé

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.02.018

zbMATH Keywords

integer programmingcombinatorial optimizationjob sequencingtraveling salesman problemtool switching

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (11)

Improved heuristic algorithms for the job sequencing and tool switching problem ⋮ Data-driven distributionally robust surgery planning in flexible operating rooms over a Wasserstein ambiguity ⋮ Unsupervised parallel machines scheduling with tool switches ⋮ Meeting the Challenges of Optimized Memory Management in Embedded Vision Systems Using Operations Research ⋮ An algorithmic framework for tool switching problems with multiple objectives ⋮ Scheduling identical parallel machines with tooling constraints ⋮ Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem ⋮ A simple and effective hybrid genetic search for the job sequencing and tool switching problem ⋮ A matheuristic for parallel machine scheduling with tool replacements ⋮ A new consensus ranking approach for correlated ordinal information based on Mahalanobis distance ⋮ Analysis of models for the stochastic outpatient procedure scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• A strongly competitive randomized paging algorithm
• The tool switching problem revisited
• Combinatorial optimization models for production scheduling in automated manufacturing systems
• Scheduling with resource management in manufacturing systems
• \(k\)-server problems with bulk requests: an application to tool switching in manufacturing
• An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
• Tool magazine arrangement and operations sequencing on CNC machines
• Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• Multiperiod tool and production assignment in flexible manufacturing systems

This page was built for publication: Improved integer linear programming formulations for the job sequencing and tool switching problem