## License Agreement (2003)

### Citations

241 |
The shifting bottleneck procedure for job shop scheduling
- Adams, Balas
- 1988
(Show Context)
Citation Context ...is aim we will also develop a new serializer. We consider two problems in this section. Both are used as standard benchmark problems for scheduling. The first one is called ABZ6 and was introduced in =-=[1]-=-. The second one is the famous MT10 and was introduced in [12]. MT10 was considered as an especially hard problem for several years. It took more than 25 years that the optimality of a found makespan ... |

188 |
A computational study of the job shop scheduling problem
- Applegate, Cook
- 1991
(Show Context)
Citation Context ...t S est T dur S dur T holds, T must be last. edge-finding Similar rules can be formulated if T is contained in S. For this kind of reasoning, the term edge-finding was coined in =-=[2]-=-. There are several variations of this idea in [5], [2], [6], [11] for the Operations Research community and in [13], [7], [3], [14] for the constraint programming community; they differ in the amount... |

164 |
An algorithm for solving the jobshop problem
- Carlier, Pinson
- 1989
(Show Context)
Citation Context ... T must be last. edge-finding Similar rules can be formulated if T is contained in S. For this kind of reasoning, the term edge-finding was coined in [2]. There are several variations of this idea in =-=[5]-=-, [2], [6], [11] for the Operations Research community and in [13], [7], [3], [14] for the constraint programming community; they differ in the amount of propagation and which sets S are considered fo... |

110 |
Adjustment of Heads and Tails for the Job-Shop Problem
- Carlier, Pinson
- 1994
(Show Context)
Citation Context ... last. edge-finding Similar rules can be formulated if T is contained in S. For this kind of reasoning, the term edge-finding was coined in [2]. There are several variations of this idea in [5], [2], =-=[6]-=-, [11] for the Operations Research community and in [13], [7], [3], [14] for the constraint programming community; they differ in the amount of propagation and which sets S are considered for edge-fin... |

91 | A new approach to computing optimal schedules for the job shop scheduling problem
- Martin, Shmoys
- 1996
(Show Context)
Citation Context .... edge-finding Similar rules can be formulated if T is contained in S. For this kind of reasoning, the term edge-finding was coined in [2]. There are several variations of this idea in [5], [2], [6], =-=[11]-=- for the Operations Research community and in [13], [7], [3], [14] for the constraint programming community; they differ in the amount of propagation and which sets S are considered for edge-finding. ... |

46 |
Industrial scheduling.
- Muth, Thompson
- 1963
(Show Context)
Citation Context ... problems in this section. Both are used as standard benchmark problems for scheduling. The first one is called ABZ6 and was introduced in [1]. The second one is the famous MT10 and was introduced in =-=[12]-=-. MT10 was considered as an especially hard problem for several years. It took more than 25 years that the optimality of a found makespan was proven [5]. 94 Chapter 11. Scheduling Figure 11.17: A sear... |

33 | Incorporating efficient operations research algorithms in constraint-based scheduling
- Baptiste, Pape, et al.
- 1995
(Show Context)
Citation Context ...ned in S. For this kind of reasoning, the term edge-finding was coined in [2]. There are several variations of this idea in [5], [2], [6], [11] for the Operations Research community and in [13], [7], =-=[3]-=-, [14] for the constraint programming community; they differ in the amount of propagation and which sets S are considered for edge-finding. The resulting propagators do a lot of propagation, but are a... |

13 |
Optimierung von Netzplänen mit Anordnungsbeziehungen bei knappen Betriebsmitteln,
- Bartusch
- 1983
(Show Context)
Citation Context ... Post precedence constraints 78a {Schedule.serializedDisj TasksOnRes Start Dur} Order tasks 81a Assign start times 78b end end 11.2 Constructing a Bridge The following problem is taken from =-=[4]-=- and is used as a benchmark in the constraint programming community. The problem is to schedule the construction of the bridge shown in Figure 11.10. Problem Specification The problem is specified as ... |

10 |
Caseau and François Laburthe. Improved clp scheduling with task intervals
- Yves
- 1994
(Show Context)
Citation Context ...ontained in S. For this kind of reasoning, the term edge-finding was coined in [2]. There are several variations of this idea in [5], [2], [6], [11] for the Operations Research community and in [13], =-=[7]-=-, [3], [14] for the constraint programming community; they differ in the amount of propagation and which sets S are considered for edge-finding. The resulting propagators do a lot of propagation, but ... |

7 | Effective Tcl/Tk Programming: Writing Better Programs with Tcl and Tk - Harrison, McLennan - 1998 |

4 | Don’t Be Puzzled
- Henz
- 1996
(Show Context)
Citation Context ...:3 constraints: [ before(4 11) before(5 10) before(6 11) disjoint(1 [2 3 5 7 8 10]) disjoint(2 [3 4 7 8 9 11]) disjoint(3 [5 6 8]) disjoint(4 [6 8 10]) disjoint(6 [7 10]) disjoint(7 [8 9]) disjoint(8 =-=[10]-=-) ] ) 42 Chapter 6. Minimizing a Cost Function 7Propagators for Redundant Constraints For some problems, the performance of a script can be drastically improved by introducing propagators for redundan... |

2 |
Caseau and François Laburthe. Disjunctive scheduling with task intervals
- Yves
- 1995
(Show Context)
Citation Context ...ull tree contains more than 47000 choice nodes. A variant of this task-oriented serializer is especially designed to find good solutions. To this aim Oz provides Schedule.taskIntervalsDistO (see also =-=[8]-=-). To find the optimal solution and to prove its optimality with this strategy we need 2979 choice nodes. But be aware that the use of this strategy may also lead to deep search trees which result in ... |