Sciweavers

283 search results - page 2 / 57
» A survey of scheduling problems with setup times or costs
Sort
View
ENDM
2010
67views more  ENDM 2010»
13 years 3 months ago
An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives
This paper deals with an NP-hard bi-objective one-machine problem with ready times involving maximum lateness and unit family setup cost objectives. Considering separately both ob...
Christian Artigues, Nicolas Jozefowiez, Mohamed Al...
ANOR
2008
171views more  ANOR 2008»
13 years 6 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
GI
2009
Springer
13 years 4 months ago
Constraint-Based Task Scheduling with Sequence Dependent Setup Times, Time Windows and Breaks
Abstract: The work presented in this article generalizes the modeling of task scheduling problems with sequence dependent setup time on the basis of task scheduling on single respe...
Armin Wolf
CPAIOR
2004
Springer
13 years 11 months ago
A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
Christian Artigues, Sana Belmokhtar, Dominique Fei...
COR
2007
121views more  COR 2007»
13 years 6 months ago
An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The obje...
Xiuli Wang, T. C. Edwin Cheng