On not-first/not-last conditions in disjunctive scheduling

European Journal of Operational Research

Volumn 127, Issue 2, 2000, Pages 332-343

  Torres, Philippe ^a   Lopez, Pierre ^a  

^a LAAS CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; OPTIMIZATION; PRODUCTION; RESOURCE ALLOCATION; SET THEORY;

BRANCH AND BOUND; DISJUNCTIVE SCHEDULING; EDGE FINDING; JOB SHOP; NOT FIRST NOT LAST PROBLEM; TIME BOUND ADJUSTMENT;

SCHEDULING;

EID: 0034563676     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00497-X     Document Type: Article

References (27)

1. Applegate D., Cook W. A computational study of the job-shop scheduling problem, ORSA. Journal of Computing. 3(2):1991;149-156.
2. P. Baptiste, C. Le Pape, A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling, in: Proceedings of the 14th IJCAI, Montreal, Canada, 1995.
3. P. Baptiste, C. Le Pape, Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling, in: Proceedings of the UK planning and scheduling meeting, Liverpool, November 1996.
4. P. Baptiste, C. Le Pape, Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems, in: Proceedings of the Third International Conference on Principles and Practice of Constraint Programming, Schloss Hagenberg, Austria, 1997.
5. P. Baptiste, C. Le Pape, W.P.M. Nuijten, Constraint-based optimisation and approximation for job-shop scheduling, in: Proceedings of the 14th IJCAI, Montreal, Canada, 1995.
6. Brucker P., Knust S., Schoo A., Thiele O. A branch and bound algorithm for the resource-constrained projectscheduling problem. European Journal of Operational Research. 107:1998;272-288.
7. J. Carlier, Ordonnancement à contraintes disjonctives, Thèse de Troisième Cycle, Université Paris VI, 1975.
8. Carlier J., Pinson E. An algorithm for solving the job-shop problem. Management Science. 35(2):1989;164-176.
9. Carlier J., Pinson E. A practical use of Jackson's preemptive schedule for solving the job-shop problem. Annals of Operations Research. 26:1990;269-287.
10. Carlier J., Pinson E. Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research. 78:1994;146-161.
11. Y. Caseau, F. Laburthe, Improving branch and bound for jobshop scheduling with constraint propagation, in: Proceedings of the Eighth Franco-Japanese-4th Franco-Chinese Conference on Combinatorics and Computer Science Brest, France, July 1995.
12. Y. Caseau, F. Laburthe, Effective Forget-and-Extend heuristics for scheduling problems, in: Proceedings of the Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems, Ferrara, Italy, 1999.
13. J. Erschler, P. Esquirol, Decision-aid in job shop scheduling: a knowledge based approach, in: Proceedings of the IEEE International Conference on Robotics and Automation, San Francisco, CA, 1986, pp. 1651-1656.
14. Erschler J., Roubellat F., Vernhes J.-P. Finding some essential characteristics of the feasible solutions for ascheduling problem. Operations Research. 24(4):1976;774-783.
15. Erschler J., Roubellat F., Vernhes J.-P. Characterizing the set of feasible sequences for. n jobs to be carried out on a single machine European Journal of Operational Research. 4(3):1980;189-194.
16. S.A. Grant, B.M. Smith, The phase transition behaviour of maintaining arc-consistency, 95.25, Division of Artificial Intelligence, University of Leeds, England, August 1995.
17. Jain A.S., Meeran S. Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research. 113:1999;390-434.
18. Levy M.-L., Lopez P., Pradin B. Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine. RAIRO-Recherche Opérationnelle/Operations Research. 33(2):1999;185-208.
19. P. Lopez, Approche énergétique pour l'ordonnancement de t â ches sous contraintes de temps et de ressources, Thèse de Doctorat, Université Paul Sabatier, Toulouse, 1991.
20. P. Lopez, P. Esquirol, Consistency enforcing in scheduling: a general formulation based on energetic reasoning, in: Proceedings of the Fifth International Workshop on Project Management and Scheduling, Poznan, Poland, 1996, pp. 155-158.
21. P. Martin, D.B. Schmoys, A new approach to computing optimal schedules for the job-shop scheduling problem, in: Proceedings of the Fifth Conference on Integer Programming and Combinatorial Optimization, 1996.
22. Nowicki E., Smutnicki C. A fast taboo search algorithm for the job-shop problem. Management Science. 42(6):1996;797-813.
23. W.P.M. Nuijten, Time and resource constrained scheduling: a constraint satisfaction approach, Ph.D. Thesis, Eindhoven University of Technology, 1994.
24. W.P.M. Nuijten, E.H.L. Aarts, A computational study of constraint satisfaction for multiple capacitated job-shop scheduling, in: Proceedings of the Fourth International Workshop on Project Management and Scheduling, Leuven, Belgium, 1994, pp. 166-173.
25. S. Smith, C. Cheng, Slack-based heuristics for constraint satisfaction scheduling, in: Proceedings of the AAAI-93, Washington, DC, 1993, pp. 139-144.
26. Tsang E.P.K. Foundations of Constraint Satisfaction. 1993;Academic Press, London.
27. P. van Hentenryck, Constraint Satisfaction in Logic Programming, Logic Programming Series, MIT Press, Cambridge, MA, 1989.