A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times
- 31 August 2008
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 35 (8) , 2635-2655
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Single-machine scheduling with time window-dependent processing timesJournal of the Operational Research Society, 2006
- A dynamic vehicle routing problem with time-dependent travel timesComputers & Operations Research, 2005
- Makespan minimization in single-machine scheduling with step-deterioration of processing timesJournal of the Operational Research Society, 2004
- Single machine scheduling with step-deteriorating processing timesEuropean Journal of Operational Research, 2001
- Scheduling with time dependent processing times: Review and extensionsJournal of the Operational Research Society, 1999
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problemEuropean Journal of Operational Research, 1996
- Single machine scheduling with start time dependent processing times: Some solvable casesEuropean Journal of Operational Research, 1994
- Scheduling jobs under simple linear deteriorationComputers & Operations Research, 1994
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problemEuropean Journal of Operational Research, 1990
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960