Alternative graph formulation for solving complex factory-scheduling problems

International Journal of Production Research

Volumn 40, Issue 15 SPEC., 2002, Pages 3641-3653

  Pacciarelli, D ^a  

^a ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; INDUSTRIAL APPLICATIONS; MACHINE SHOPS; MATHEMATICAL MODELS; PERFORMANCE;

GRAPH FORMULATION; JOB SHOP SCHEDULING MODEL;

SCHEDULING;

EID: 0037109620     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540210136478     Document Type: Article

References (25)

1. Adams, J., Balas, E. and Zawack, D., 1988, The shifting bottleneck procedure for job shop scheduling. Management Science, 34, 391-401.
2. Applegate, D. and Cook, W., 1991, A computational study of the job shop scheduling problem. Orsa Journal on Computing, 3, 149-156.
3. Arbib, C., Pacciarelli, D. and Smriglio, S., 1999, A three-dimensional matching model for perishable production scheduling. Discrete Applied Mathematics, 92, 1-15.
4. Balas, E., 1979, Disjunctive programming. Annals of Discrete Mathematics, 5, 3-51.
5. Brucker, P., Jurish, B. and Sievers, B., 1994, A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics, 49, 107-127.
6. Carlier, J. and Pinson, E., 1994, Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research, 78, 146-161.
7. Dell'Amico, M. and Trubian, M., 1993, Applying taboo search to the job-shop scheduling problem. Annals of Operations Research, 41, 231-252.
8. Grabowski, J., Pempera, J. and Smutnicki, C., 1997, Scheduling in production of concrete wares. In Operations Research Proceedings 1996 (Braunschweig) (Berlin: Springer), pp. 192-196.
9. Hall, N. J. and Sriskandarajah, C., 1996, A survey on machine scheduling problems with blocking and no-wait in process. Operations Research, 44, 510-525.
10. Lawrence, S., 1984, Supplement to 'Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques' (Pittsburgh: GSIA, Carnagie Mellon University).
11. Lixin Tang, Jiyin Liu, Aiying Rong and Zihou Yang, 2000, A mathematical programming model for scheduling steelmaking-continuous casting production. European Journal of Operational Research, 120, 423-435.
12. Mascis, A. and Pacciarelli, D., 2000, Machine scheduling via alternative graphs. Report DIA-46-2000 (Rome: Dipartimento di Informatica e Automazione, Università Roma Tre).
13. McCormick, S. T., Pinedo, M. L., Shenker, S. and Wolf, B., 1989, Sequencing in an assembly line with blocking to minimize cycle time. Operations Research, 37, 925-935.
14. Muth, J. F. and Thompson, G. L. (eds), 1963, Industrial Scheduling (Dordrecht, The Netherlands: Kluwer).
15. Nahmias, S., 1982, Perishable inventory theory: a review. Operations Research, 30, 680-708.
16. Nowicki, E. and Smutnicki, C., 1996, A fast taboo search algorithm for the job shop scheduling problem. Management Science, 42, 797-813.
17. Ovacik, I. M. and Uzsoy, R., 1992, A shifting bottleneck algorithm for scheduling semiconductor testing operations. Journal of Electronic Manufacturing, 2, 119-134.
18. Ovacik, I. M. and Uzsoy, R., 1997, Decomposition Methods for Complex Factory Scheduling Problems (Englewood Cliffs, NJ: Prentice-Hall).
19. Pinedo, M., 1995, Scheduling - Theory, Algorithms and Systems (Englewood Cliffs, NJ: Prentice-Hall).
20. Reklaitis, G. V., 1982, Review of scheduling of process operations. AIChE Symposium Series, 78, 119-133.
21. Roy, B. and Sussman, B., 1964, Les problèm d'ordonnancement avec contraintes disjonctives. Note DS No. 9bis (Paris: SEMA).
22. Sadeh, N., Sycara, K. and Xiong, Y., 1995, Backtracking techniques for the job shop scheduling constraints satisfaction problem. Artificial Intelligence, 76, 455-480.
23. Schutten, J. M. J., 1998, Practical job shop scheduling. Annals of Operations Research, 83, 161-177.
24. Strusevich, V. A., 1997, Shop scheduling problems under precedence constraints. Annals of Operations Research, 69, 351-377.
25. White, K. P. and Rogers, R. V., 1990, Job-shop scheduling: limits of the binary disjunctive formulation. International Journal of Production Research, 28, 2187-2200.