A dynamic programming approach for the job sequencing and tool switching problem

DOI10.1007/978-3-031-95976-9_5MaRDI QIDQ6897983zbMATH OpenFDO

Authors Emma Legrand, Vianney Coppé, Daniele Catanzaro, Pierre Schaus

Publication date 19 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-95976-9_5

zbMATH Keywords

A*branch and boundcombinatorial optimizationdynamic programmingjob sequencingtool switching

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites work

• Buffered Resource Constraint: Algorithms and Complexity
• Discrete optimization with decision diagrams
• Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
• Improved integer linear programming formulations for the job sequencing and tool switching problem
• Iterative beam search algorithms for the permutation flowshop
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem
• The traveling salesman problem. A computational study.

This page was built for publication: A dynamic programming approach for the job sequencing and tool switching problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6897983)