A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times

DOI10.1016/J.COR.2006.12.021MaRDI QIDQ2471235zbMATH OpenOpenAlexFDO

Authors Gabriella Stecco, Jean-François Cordeau, Elena Moretti

Publication date 22 February 2008

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2006.12.021

zbMATH Keywords

traveling salesman problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• A branch and bound method for the job-shop problem with sequence-dependent setup times
• Minimizing sum of completion times on a single machine with sequence-dependent family setup times
• A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness

Cites work

• A concise survey of scheduling with time-dependent processing times
• A dynamic vehicle routing problem with time-dependent travel times
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
• Integer Programming Formulation of Traveling Salesman Problems
• Makespan minimization in single-machine scheduling with step-deterioration of processing times
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• Scheduling jobs under simple linear deterioration
• Scheduling with time dependent processing times: Review and extensions
• Single machine scheduling with start time dependent processing times: Some solvable cases
• Single machine scheduling with step-deteriorating processing times
• Single-machine scheduling with time window-dependent processing times
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Time dependent vehicle routing problem with a multi ant colony system
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms

Cited in

(12)

• A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints
• Distributionally robust single machine scheduling with the total tardiness criterion
• An integer programming approach for the time-dependent traveling salesman problem with time windows
• A comparison of algorithms for finding an efficient theme park tour
• Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
• An enhanced lower bound for the time-dependent travelling salesman problem
• Solving the single crane scheduling problem at rail transshipment yards
• On path ranking in time-dependent graphs
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
• The third comprehensive survey on scheduling problems with setup times/costs
• A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times

This page was built for publication: A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times

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