Results 1  10
of
47
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.
O(n log n) filtering algorithms for unary resource constraint
 In: Proceedings of CPAIOR 2004
, 2004
"... Abstract. So far, edgefinding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another two filtering algorithms: notfirst/notlast and propagation of detectable precedences. These two algorithms can b ..."
Abstract

Cited by 33 (4 self)
 Add to MetaCart
(Show Context)
Abstract. So far, edgefinding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another two filtering algorithms: notfirst/notlast and propagation of detectable precedences. These two algorithms can be used together with edgefinding to further improve the filtering. This paper also propose new O(n log n) implementation of fail detection (overload checking). 1
Local Search and Constraint Programming
, 2001
"... this paper, we review hybrid methods that combine principles from both methods. A first set of such hybrids belongs to the family of local search methods (going from one solution to a neighbor one) and use CP as a way to e#ciently explore large neighborhoods with side constraints. A second set belon ..."
Abstract

Cited by 30 (0 self)
 Add to MetaCart
this paper, we review hybrid methods that combine principles from both methods. A first set of such hybrids belongs to the family of local search methods (going from one solution to a neighbor one) and use CP as a way to e#ciently explore large neighborhoods with side constraints. A second set belongs to the family of global search (tree search) methods and use LS as a way to improve some of the nodes of the search tree or to explore a set of paths close to the path selected by a greedy algorithm in the search tree. In short, LS may use ideas from CP in order to make large neighborhoods more tractable, while CP may use ideas from LS to explore a set of solutions close to the greedy path in a tree search and converge more quickly towards the optimum
O.: Temporal networks with alternatives: Complexity and model
 In: Proceedings of the Twentieth International Florida AI Research Society Conference (FLAIRS
, 2007
"... Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose an extension of temporal networks by parallel and alternative branching. This extension supports modelling of alternative ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose an extension of temporal networks by parallel and alternative branching. This extension supports modelling of alternative paths in the network; in particular, it is motivated by modelling alternative process routes in manufacturing scheduling. We show that deciding which nodes can be consistently included in this extended temporal network is an NPcomplete problem. The ideas are presented using precedence networks, but we also show how they can be extended to simple temporal networks.
Vehicle Routing and Job Shop Scheduling: What's the difference?
 Proc. of the 13th International Conference on Automated Planning and Scheduling
, 2003
"... Despite a number of similarities, vehicle routing problems and scheduling problems are typically solved with different techniques. In this paper, we undertake a systematic study of problem characteristics that differ between vehicle routing and scheduling problems in order to identify those that ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
Despite a number of similarities, vehicle routing problems and scheduling problems are typically solved with different techniques. In this paper, we undertake a systematic study of problem characteristics that differ between vehicle routing and scheduling problems in order to identify those that are important for the performance of typical vehicle routing and scheduling techniques. In particular, we find that the addition of temporal constraints among visits or the addition of tight vehicle specialization constraints significantly improves the performance of scheduling techniques relative to vehicle routing techniques.
Batch Processing With Sequence Dependent Setup Times: New Results
, 2002
"... A constraint propagation (filtering) turned out to be an efficient method how to reduce search space for backtrackbased algorithms. This paper brings several improvements of filtering methods for batch processing with sequence dependent setup times. ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
(Show Context)
A constraint propagation (filtering) turned out to be an efficient method how to reduce search space for backtrackbased algorithms. This paper brings several improvements of filtering methods for batch processing with sequence dependent setup times.
A new exact solution algorithm for the job shop problem with sequencedependent setup times
 In: J.C. Regin and M. Rueher (Eds.), 1st International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Note in Computer Science
, 2004
"... Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDSTJSP). The problem consists in scheduling jobs, each job being a set of elementary operations to be processed on different machines. The objective pursued is to minimize the completion ti ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDSTJSP). The problem consists in scheduling jobs, each job being a set of elementary operations to be processed on different machines. The objective pursued is to minimize the completion time of the set of operations. We investigate a relaxation of the problem related to the traveling salesman problem with time windows (TSPTW). Our approach is based on a Branch and Bound procedure, including constraint propagation and using this relaxation. It compares favorably over the best available approaches from the literature on a set of benchmark instances. 1
Incremental Propagation of Time Windows on Disjunctive Resources
 In Proceedings of the Nineteenth International Florida Artificial Intelligence Research Society Conference (FLAIRS 2006
, 2006
"... Constraintbased techniques are frequently used in solving reallife scheduling problems thanks to natural modeling capabilities and strong constraint propagation techniques encoded within global constraints. In this paper we present new incremental propagation rules for shrinking time windows of ac ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Constraintbased techniques are frequently used in solving reallife scheduling problems thanks to natural modeling capabilities and strong constraint propagation techniques encoded within global constraints. In this paper we present new incremental propagation rules for shrinking time windows of activities allocated to a disjunctive resource. These rules use information about precedence constraints between the activities and support optional activities.
Incremental Propagation Rules for A Precedence Graph with Optional Activities and Time Windows
 In Proceedings of The 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2005
"... Abstract: Constraintbased scheduling is a powerful tool for solving reallife scheduling problems thanks to a natural integration of special solving algorithms encoded in global constraints. The filtering algorithms behind these constraints are based on propagation rules modelling some aspects of t ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
Abstract: Constraintbased scheduling is a powerful tool for solving reallife scheduling problems thanks to a natural integration of special solving algorithms encoded in global constraints. The filtering algorithms behind these constraints are based on propagation rules modelling some aspects of the problems, for example a unary resource. This paper describes new incremental propagation rules integrating a propagation of precedence relations and time windows for activities allocated to a unary resource. Moreover, the rules also cover so called optional activities that may or may not be present in the final schedule.