Results 1 
9 of
9
A Survey of Scheduling Problems with Setup Times or Costs
"... The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by Allahverdi et al. (1999), who reviewed the literature since the mid1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setu ..."
Abstract

Cited by 104 (5 self)
 Add to MetaCart
The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by Allahverdi et al. (1999), who reviewed the literature since the mid1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per year being added to the literature. The objective of this paper is to provide an extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers. Given that so many papers have appeared in a short time, there are cases where different researchers addressed the same problem independently, and sometimes by using even the same technique, e.g., genetic algorithm. Throughout the paper we identify such areas where independently developed techniques need to be compared. The paper classifies scheduling problems into those with batching and nonbatching considerations, and with sequenceindependent and sequencedependent setup times. It further categorizes the literature according to shop environments, including singlemachine, parallel machines, flow shop, nowait flow shop, flexible flow shop, job shop, open shop, and others.
ConstraintBased 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 respectively exclusive resources: Besides working activities also work breaks are respected properly which is formally prove ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
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 respectively exclusive resources: Besides working activities also work breaks are respected properly which is formally proven. The additional contribution of this article is an effective pruning algorithm according to the presented modeling approach. Benchmark examinations show that the introduced modeling and pruning approach is comparable with another stateoftheart constraintbased approach. Within these examination the optimality of a lower bound of one benchmark instance, namely of t2ps09, is proven – to the best of one’s knowledge – the first time. 1
The Unary Resource with Transition Times
"... Abstract. Transition time constraints are ubiquitous in scheduling problems. They are said to be sequencedependent if their durations depend on both activities between which they take place. In this context, we propose to extend the Θtree and ΘΛtree data structures introduced by Vilím in order ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Transition time constraints are ubiquitous in scheduling problems. They are said to be sequencedependent if their durations depend on both activities between which they take place. In this context, we propose to extend the Θtree and ΘΛtree data structures introduced by Vilím in order to strengthen the bound computation of the earliest completion time of a set of activities, by taking into account the sequence dependent transition time constraints. These extended structures can be substituted seamlessly in the stateoftheart Vilím’s filtering algorithms for unary resource constraints (Overload Checking, Detectable Precedences, NotFirst/NotLast and EdgeFinding algorithms) without changing their O(n log(n)) time complexities. Furthermore, this new propagation procedure is totally independent from additional constraints or the objective function to optimize. The proposed approach is able to reduce the number of nodes by several order of magnitudes on some instances of the jobshop with transition times problem, without introducing too much overhead on other instances for which it is less effective.
National Academy of Sciences of Belarus,
"... Abstract: This article addresses the jobshop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequencedependent setup and removal times. The processing of each job includes at most two operations that have to be nonpreemptive. Machine routes may diff ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract: This article addresses the jobshop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequencedependent setup and removal times. The processing of each job includes at most two operations that have to be nonpreemptive. Machine routes may differ from job to job. If all setup and removal times are equal to zero, this problem is polynomially solvable via Jackson's pair of job permutations, otherwise it is NPhard even if each of n jobs consists of one operation on the same machine. We present sufficient conditions when Jackson's pair of permutations may be used for solving the twomachine jobshop problem with sequencedependent setup and removal times. For the general case of this problem, the results obtained provide polynomial lower and upper bounds for the objective function value which are used in a branchandbound algorithm. Computational experiments show that an exact solution for this problem may be obtained in a suitable time for n ≤ 280. We also develop a heuristic algorithm and present a worst case analysis for it.
25 p. <10.1007/s1047900702830>. <hal00103387>
, 2006
"... branch and bound method for the jobshop problem with sequencedependent setup times ..."
Abstract
 Add to MetaCart
(Show Context)
branch and bound method for the jobshop problem with sequencedependent setup times
sequencedependent
, 2005
"... branch and bound method for the jobshop problem with ..."
(Show Context)
Contents
, 2006
"... In this paper we give an overview of some industrial applications built using global constraints. We look at three systems from different application domains and show the core models used to express their constraints. We also consider different search strategies that have been applied and discuss so ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper we give an overview of some industrial applications built using global constraints. We look at three systems from different application domains and show the core models used to express their constraints. We also consider different search strategies that have been applied and discuss some of the application aspects.
SequenceDependent Setup Times in a TwoMachine JobShop with Minimizing the Schedule Length
, 2006
"... AbstractThis article addresses the jobshop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequencedependent setup times and removal times. The processing of each job includes at most two operations that have to be nonpreemptive. Machine routes may ..."
Abstract
 Add to MetaCart
(Show Context)
AbstractThis article addresses the jobshop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequencedependent setup times and removal times. The processing of each job includes at most two operations that have to be nonpreemptive. Machine routes may differ from job to job. If all setup and removal times are equal to zero, this problem is polynomially solvable via Jackson's permutations, otherwise it is NPhard even if each of n jobs consists of one operation on the same machine. We present sufficient conditions when Jackson’s permutations may be used for solving the twomachine jobshop problem with sequencedependent setup times and removal times. For the general case of this problem, the results obtained provide polynomial lower and upper bounds for the makespan which are used in a branchandbound algorithm. Computational experiments show that an exact solution for this problem may be obtained in a suitable time for n ≤ 280. We also develop a heuristic algorithm and present a worst case analysis. KeywordsScheduling theory, Setup, Jobshop 1.