Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem
From MaRDI portal
Publication:3057161
DOI10.1002/net.20341zbMath1200.90061OpenAlexW4253550882MaRDI QIDQ3057161
Gianpaolo Ghiani, Emanuela Guerriero, Antonio Grieco
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20341
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (8)
Improved integer linear programming formulations for the job sequencing and tool switching problem ⋮ Improved heuristic algorithms for the job sequencing and tool switching problem ⋮ Unsupervised parallel machines scheduling with tool switches ⋮ An algorithmic framework for tool switching problems with multiple objectives ⋮ Scheduling identical parallel machines with tooling constraints ⋮ A simple and effective hybrid genetic search for the job sequencing and tool switching problem ⋮ A matheuristic for parallel machine scheduling with tool replacements ⋮ Scheduling multi-colour print jobs with sequence-dependent setup times
Cites Work
- The tool switching problem revisited
- Facet identification for the symmetric traveling salesman polytope
- An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
- Tool magazine arrangement and operations sequencing on CNC machines
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Multiperiod tool and production assignment in flexible manufacturing systems
- Unnamed Item
This page was built for publication: Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem
