Two-job shop scheduling problems with availability constraints

Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

Volumn , Issue , 2004, Pages 253-259

  Aggoune, Riad ^a  

^a LUXEMBOURG INSTITUTE OF SCIENCE AND TECHNOLOGY   (Luxembourg)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; MAINTENANCE; OPTIMIZATION; WASHING;

PARALLEL MACHINES; POLYNOMIAL ALGORITHMS; TWO-JOB SCHEDULING PROBLEM;

SCHEDULING;

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

References (13)

1. Adiri, I., J. Bruno, E. Frostig, and , A. H. G. Rinnooy Kan (1989). Single machine flow-time scheduling with a single breakdown. Acta Informatica, 26, 679-696.
2. Aggoune, R. (2002). Ordonnancement d'Ateliers sous Contraintes de Disponibilité des Machines. Ph.D. Thesis, Universite de Metz, France.
3. Akers, S. B. and J. Friedman (1955). A non-numerical approach to production scheduling problems. Operations Research, 3, 429-442.
4. Blazewicz, J., J. Breit, P. Formanowicz, W. Kubiak and G. Schmidt. (2001). Heuristic algorithms for the two-machine flowshop problem with limited machine availability. Omega Journal, 29, 599-608.
5. Brucker, P. (1988). An efficient algorithm for the job-shop problem with two jobs. Computing, 40, 353-359.
6. Kubiak, W., J. Blazewicz, P. Formanowicz, J. Breit, and G. Schmidt. (2002). Two-machine flow shops with limited machine availability. European Journal of Operational Research, 136, 528-540.
7. Lee, C. Y. (1996). Machine scheduling with an availability constraint. Journal of Global Optimization, 9, 395-416.
8. Lee, C. Y. (1997). Minimizing the makespan in two-machine flowshop scheduling problem with an availability constraint. Operations Research Letters, 20, 129-139.
9. Lee, C. Y. (1999). Two-machine flowshop scheduling with availability constraints. European Journal of Operational Research, 114, 420-429.
10. Schmidt, G. (1984). Scheduling on semi-identical processors. Z. Oper. Res., A28, 153-162.
11. Schmidt, G. (1988). Scheduling independent tasks with deadlines on semi-identical processors. Journal of Operational Research Society, 39, 271-277.
12. Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121, 1-15.
13. Sotskov, Y. N. (1985). Optimal servicing two jobs with a regular criterion, In: Automation of Designing Processes, Minsk, 86-95 (in Russian).