Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times

Proceedings of the 6th International Conference on Artificial Intelligence Planning Systems, AIPS 2002

Volumn , Issue , 2002, Pages 312-320

  Vilím, Petr ^a   Barták, Roman ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; SCHEDULING ALGORITHMS; SIGNAL FILTERING AND PREDICTION;

% REDUCTIONS; COMBINATORIAL PROBLEM; DOMAIN FILTERING; FILTERING ALGORITHM; PROCESSING ENVIRONMENTS; SEARCH SPACES; SEQUENCE-DEPENDENT SETUP TIME;

BATCH DATA PROCESSING;

EID: 35048869180     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Baptiste, P., and Le Pape, C. 1996. Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. In Proceedings of the Fifteenth Workshop of the U.K. Planning Special Interest Group.
2. Baptiste, P.; Le Pape, C.; and Nuijten, W. 1998. Satisfiability tests and time-bound adjustments for cumulative scheduling problems. In Technical Report 98/97. Universit de Technologie de Compigne.
3. Brucker, P., and Thiele, O. 1996. A branch and bound method for the general shop problem with sequence dependent setup-times. In OR Spectrum, 145-161. Springer-Verlag.
4. Brucker, P. 2001. Scheduling Algorithms. Springer-Verlag, 3rd edition.
5. Carlier, J., and Pinson, E. 1989. An algorithm for solving the job-shop problem. Management Science 35(2):164-176.
6. Caseau, Y., and Laburthe, F. 1994. Improved CLP Scheduling with Task Intervals. In van Hentenryck, P., ed., Proceedings of the 11th International Conference on Logic Programming, ICLP'94. The MIT press.
7. Caseau, Y., and Laburthe, F. 1995. Disjunctive scheduling with task intervals. In Technical report, LIENS Technical Report 95-25. Ecole Normale Suprieure Paris, Franc.
8. Caseau, Y., and Laburthe, F. 1996. Cumulative scheduling with task intervals. In Joint International Conference and Symposium on Logic Programming, 363-377.
9. Martin, P., and Shmoys, D. B. 1996. A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. In Cunningham, W. H.; McCormick, S. T.; and Queyranne, M., eds., Proceedings of the 5th International Conference on Integer Programming and Combinatorial Optimization, IPCO'96, 389-403.
10. Vilím, P., and Barták, R. 2002a. A benchmark set for batch processing with sequence dependent setup times. http://kti.mff.cuni.cz/∼vilim/batch.
11. Vilím, P., and Barták, R. 2002b. A filtering algorithm sequence composition for batch processing with sequence dependent setup times. Technical Report 2002/1, Charles University, Faculty of Mathematics and Physics.