BATCH PROCESSING WITH SEQUENCE DEPENDENT SETUP TIMES: NEW RESULTS
|
Abstract:
Abstract: A constraint propagation (filtering) turned out to be an efficient method how to reduce search space for backtrack-based algorithms. This paper brings several improvements of filtering methods for batch processing with sequence dependent setup times. The first one is domain filtering based on a precedence graph---such filtering can be useful even when no precedences are given at the start. I describe how to easily detect all the precedences found by the edge-finding algorithm and how to maintain a transitive closure of the precedence graph in reasonable time. The results for the precedence graph hold also for the usual disjunctive scheduling (unary resource) because it is a special case of batch processing (without any setups). This paper also proposes a new, more effective version of the not-first/not-last filtering algorithm for batch processing with sequence dependent setup times. 1
Citations
| 36 | Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling – Baptiste, Pape - 1996 |
| 24 | Solving scheduling problems with setup times and alternative resources – Focacci, Laborie, et al. - 2000 |
| 15 | On not-first/not-last conditions in disjunctive scheduling – Torres, Lopez - 1999 |
| 9 | Filtering algorithms for batch processing with sequence dependent setup times – Vilím, Barták - 2002 |
| 5 | Complex scheduling problems – Brucker - 1999 |
| 5 | A benchmark set for batch processing with sequence dependent setup times. http://kti.mff.cuni.cz/vilim/batch – Vilím, Barták - 2002 |
| 4 | A filtering algorithm sequence composition for batch processing with sequence dependent setup times – Vilm, Bartak - 2002 |
