Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment

International Journal of Production Research

Volumn 39, Issue 4, 2001, Pages 689-708

  Low, Chinyao ^a   Wu, Tai Hsi ^a  

^a DA YEH UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; SCHEDULING; SIMULATED ANNEALING;

MACHINE LOADING; PART INPUT SEQUENCING; PART TYPE SELECTION; ROUTING-EXCHANGING PROCEDURE; SEQUENCE-IMPROVING PROCEDURE;

FLEXIBLE MANUFACTURING SYSTEMS;

EID: 0035836306     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540150504403     Document Type: Article

References (31)

1. Aanen, E., Gaalman, G. J. and Naijn, W. M., 1993, A scheduling approach for a flexible manufacturing system. International Journal of Production Research, 31, 2369-2385.
2. Adenso-Diaz, B., 1996, An SA/TS mixture algorithm for the scheduling tardiness problem. European Journal of Operational Research, 88, 516-524.
3. Adams, J., Balas, E. and Zawack, D., 1988, The shifting bottleneck procedure for job shop scheduling. Management Science, 34, 391-401.
4. Applegate, D. and Cook, W., 1991, A computational study of job shop scheduling. ORSA Journal of Computing, 3, 149-156.
5. Balas, E., 1969, Machine sequencing via disjunctive graph: an implicit enumeration algorithm. Operations Research, 17, 1-10.
6. Barnes, J. W. and Chambers, J. B., 1995, Solving the job shop scheduling problem with tabu search. IIE Transactions, 27, 257-263.
7. Bigel, J. E. and Davern, J. J., 1990, Genetic algorithms and job shop scheduling. Computers and Industrial Engineering, 19, 81-91.
8. Blazewicz, J., Domschke, W. and Pesch, E., 1996, The job shop scheduling problem: convention and new solution techniques. European Journal of Operational Research, 91, 1-33.
9. Brandimarte, P. and Calderini, M., 1995, A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling. International Journal of Production Research, 33, 161-181.
10. Brucker, P. and Jurisch, B., 1993, A new lower bound for the job shop scheduling problem. European Journal of Operational Research, 64, 156-167.
11. Carlier, J. and Pinson, E., 1989, An algorithm for solving the job shop problem. Management Science, 35, 164-176.
12. Chandra, J. and Talavage, J., 1991, Intelligent dispatching for flexible manufacturing systems. International Journal of Production Research, 29, 2209-2225.
13. Chang, Yih-Long, Matsuo, H. and Sullivan, R. S., 1989, A bottleneck-based beam search for job scheduling in a flexible manufacturing system. International Journal of Production Research, 27, 2209-2225.
14. Della Corce, F., Tadie, R. and Volta, G., 1995, A genetic algorithm for job shop problem. Computers and Operations Research, 22, 15-24.
15. Dell'Amico, M. and Trubian, M., 1993, Applying tabu search to job shop scheduling problem. Annals of Operations Research, 41, 231-252.
16. Glover, F. and Laguna, M., 1997, Tabu Search (Boston, MA: Kluwer Academic Publishers).
17. Gupta, J. N. D. and Tunc, E. A., 1994, Scheduling a two-stage hybrid flowshop with separable setup and removal times. European Journal of Operational Research, 77, 415-428.
18. He, Z., Yang, T. and Tiger, A., 1996, An exchange heuristic imbedded with simulated annealing for due-dates job shop scheduling. European Journal of Operational Research, 91, 99-117.
19. Holsapple, C., Jacob, V., Pakath R. and Zaveri, J., 1993, A genetics-based hybrid scheduler for generating static schedules in flexible manufacturing contexts. IEEE Transactions on Systems, Man, and Cybernetics, 23, 953-971.
20. Hutchison, J., Leong, K., Snyder, D. and Ward, P., 1991, Scheduling approaches for random job shop flexible manufacturing systems. International Journal of Production Economics, 29, 1053-1067.
21. Moser, M. and Engell, S., 1992, A survey of priority rules for FMS scheduling and their performance for the benchmark problem. Proceedings of the 31st Conference on Decision and Control, pp. 392-397.
22. Ovacik, I. M. and Uzsoy, R., 1994, Exploiting shop floor status information to schedule complex job shops. Journal of Manufacturing Systems, 13, 73-84.
23. Sawik, T., 1990, Modelling and scheduling of flexible manufacturing system. European Journal of Operational Research, 45, 177-190.
24. Sakawa, M., Kato, K. and Mori, T., 1996, Flexible scheduling in a machining center through genetic algorithms. Computers and Industrial Engineering, 30, 931-940.
25. Schutten, J. M. J. and Leussink, R. A. M. 1996, Parallel machine scheduling with release dates, due dates and family setup times. International Journal of Production Economics, 46-47, 119-125.
26. Schutten, J. M. J., van de Velde, S.-L. and Zijm, W. H. M., 1996, Single-machine scheduling with release dates, due dates and family setup times. Management Science, 42, 1165-1174.
27. Stoeva, S. P., 1990, A due date based dispatching rule for flexible manufacturing systems. International Journal of Production Research, 28, 1991-1999.
28. Van Laarhoven, P. J. M., Aarts, E. H. L. and Lenstra, J. K., 1992, Job shop scheduling by simulated annealing. Operations Research, 40, 113-125.
29. Widmer, M., 1991, Job shop scheduling with tool constraints: a tabu search approach. Journal of Operational Research Society, 42, 75-82.
30. Zdrzalka, S., 1994, Preemptive scheduling with releases dates, delivery times and sequence independent setup times. European Journal of Operational Research, 76, 60-71.
31. Zdrzalka, S., 1996, A sequencing problem with family setup times. Discrete Applied Mathematics, 66, 161-183.