Modelling and optimization of industrial manufacturing processes subject to no-wait constraints

International Journal of Production Research

Volumn 37, Issue 11, 1999, Pages 2585-2607

  Macchiaroli, R ^a   Mole S ^a   Riemma, S ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUZZY SETS; HEURISTIC METHODS; MANUFACTURE; PRODUCTION ENGINEERING;

HEURISTIC DECOMPOSITION; NO WAIT MANUFACTURING PROCESS; PRODUCTION SYSTEM MANAGEMENT; TABU SEARCH;

SCHEDULING;

EID: 0032671418     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075499190671     Document Type: Article

References (22)

1. Adams, J., Balas, E., and Zawack, D., 1989, The shifting bottleneck procedure for job-shop scheduling. Management Science, 34, 391-401.
2. Agnetis, A., 1989, No-wait shop scheduling with large lot size. Research Report 16.89, Dipartimento di Informatica e Sistemistica, Universita di Roma La Sapienza, Italy.
3. Agnetis, A., Arbib, C., and Stecke, K. E., 1990, Optimal two-machine scheduling in a flexible flow system. Proceedings of the Second International Conference on Computer Integrated Manufacturing, Rennselaer Polytechnic Institute, Troy, New York.
4. Applegate, D., and Cook, W., 1990, A computational study of the job-shop scheduling problem. ORSA Journal of Computing, 3, 149-156.
5. Della Croce, F., 1995, Generalized pairwise interchanges and machine scheduling. European Journal of Operational Research, 37, 310-319.
6. Dell’ Amico, M., and Trubian, M., 1993, Applying tabu search to the job shop scheduling problem. Annals of Operations Research, 41, 231-252.
7. French, S., 1982, Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop (Ellis Horwood).
8. Glover, F., 1990, Tabu search: A tutorial. Interfaces, 20, 74-94.
9. Goyal, S. K., 1973, A note on: on the flow shop sequencing problem with no-wait in process. Operations Research Quarterly, 24, 130-133; 1975, Job shop sequencing problem with no-wait in process. International Journal of Production Research, 13, 197-206.
10. Hall, N. G., and SRIKANDARAJAH, C., 1996, A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44, 510-525.
11. Kubiak, W., 1989, A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem. European Journal of Operational Research, 43, 267-270.
12. Macchiaroli, R., Mole', S., and Riemma, S., 1996a, A fuzzy-approach to optimize manufacturing processes with no-wait constraints. Proceedings of the 5th IEEE International Conference on Control Applications, USA.
13. Macchiaroll, R., Mole', S., Riemma, S., and TRIFILETTI, L., 1996b, Design and implementation of a tabu search algorithm to solve the no-wait job shop scheduling problem. Proceedings of the IEEE/IMACS Conference on Computational Engineering in Systems Applications-CESA’96, Lille, France.
14. Morton, T. E. and Pentico, D. W., 1993, Heuristic Scheduling Systems (New York: Wiley).
15. Panwalkar, S. S., and Iskander, W., 1977, A survey of scheduling rules. Operations Research, 25, 45-61.
16. Phillips, L. W., and Unger, P. S., 1976, Mathematical programming solution of a hoist scheduling program. AIIE Transactions, 8, 219-225.
17. Piehler, J., 1960, Ein beitrag zum reinhenfolgeproblem. Unternehmensforschung, 4, 138-142.
18. Reddi, S. S., and Ramamoorthy, C. V., 1973a, Reply to Dr. Goyal’s comments. Operations Research Quarterly, 24, 133-134; 1973b, A scheduling problem. Operations Research Quarterly, 24, 441-446; 1983, On the flow shop sequencing problem with no-wait in process. Journal of the Operational Research Society, 23, 323-331.
19. SRISKANDARAJAH, C., and Ladet, P., 1986, Some no-wait shops scheduling problems: complexity aspect. European Journal of Operational Research, 24, 424-438.
20. Takagi, T., and Sugeno, M., 1985, Identification of systems and its applications to modeling and control. IEEE Transactions on Systems, Man, and Cybernetics, 15, 116-132.
21. Taillard, E., 1989, Parallel taboo search technique for the job-shop scheduling problem. WP 89/11, Dept de Mathematiques, Ecole Polytechnique de Lausanne, Switzerland.
22. 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.