Dispatching in a workstation belonging to a re-entrant production line under sequence-dependent set-up times

Production Planning and Control

Volumn 9, Issue 7, 1998, Pages 690-699

  Arzi, Yohanan ^a   Raviv, David ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Heuristics; Production; Re entrant production lines; Sequence dependent set up times; Simulation

Indexed keywords

COMPUTER SIMULATION; HEURISTIC METHODS; INVENTORY CONTROL; PROCESS CONTROL; RANDOM PROCESSES; SCHEDULING; STRATEGIC PLANNING;

RE-ENTRANT PRODUCTION LINES; SEQUENCE DEPENDENT SET-UP TIMES; WORK-IN-PROCESS (WIP);

PRODUCTION CONTROL;

EID: 0032182879     PISSN: 09537287     EISSN: 13665871     Source Type: Journal    
DOI: 10.1080/095372898233696     Document Type: Article

References (31)

1. Adam, E. E.Jr, and Ebert, R.J., 1992, Operations scheduling. In: Production and Operations Management: Concepts, Models, and Behavior, 5th edn (Englewood Cliffs, NJ: Prentice-Hall), pp. 409-447.
2. Bhaskaran, K., and Pinedo, M., 1992, Dispatching. In G. Solvency (ed.), Handbook of Industrial Engineering, 2nd ed. (New York: John Wiley and Sons, Inc.), pp. 2182-2198.
3. BUZACOTT, J. A., and SHANTHIKUMAR, J. G., 1993, Stochastic Models of M anufacturing Systems Englewood Cliffs, NJ: Prentice-Hall, Chapter 4, pp. 101-102.
4. Chung-Yee, L., Martin-Vega, L. A., Uzsoy, R., and Hinchman, J., 1993, Implementation of a decision support system for scheduling semiconductor test operations. Journal of Electronics Manufacturing, 3, 121-131.
5. Dobson, G., 1992, The cyclic lot scheduling problem with sequence-dependent. operations Research, 40, 736-749.
6. Flynn, B. B., 1987, Repetitive lots: The use of a sequence- dependent set-up time scheduling procedure in group technology and traditional shops. Journal of Operations Management, 7, 203-216.
7. Foo, F. C., and Wagner, J. G., 1983, Set-up times in cyclic and acyclic group technology scheduling systems. International Journal of Production Research, 21, 63-73.
8. Gavett, J. W., 1965, Three heuristic rules for sequencing jobs to a single production facility. Management S cience, 11, 166-176.
9. Gupta, J. N. D., and Darrow, W P., 1986, The two-machine sequence dependent flowshop scheduling problem. E uropean Journal of Operational Research, 24, 439-446.
10. Gupta, S. K., 1982, Njobs and M machines job-shop problems with sequence dependent set-up times. International Journal of Production Research, 20, 643-656.
11. Haynes, R. D., Komar, GA, and Byrd, J., 1973, The effectiveness of three heuristic rules for job sequencing in a single production facility. Management Science, 19, 575-580.
12. Laguna, M., Wesley Barnes, J., and Glover, F., 1993, I ntelligent scheduling with Tabu search: an application to jobs with linear delay penalties and sequence dependent set-up costs and times. Applied Intelligence; T he International Journal of Artificial Intelligence, Neural Networks, and Complex Problem Solving T echnologies, 3, 159-172.
13. Lee, Y. H., Bhaskaran, K., and Pinedo, M., 1997, A heuristic to minimize the total weighted tardiness with sequence- dependent set-ups. IIE Transactions, 29, 45-52.
14. Lockett, A G., and Muhlemann, A. P., 1972, A scheduling problem involving sequence dependent changeover times. Operations Research, 20, 895-902.
15. Low, G Y., 1995, Job shop scheduling for sequence dependent set-ups. Computer and Industrial Engineering, 29, 279-283.
16. Mahmoodi, F., and Dooley, K.J., 1991, A comparison of exhaustive group technology heuristics in a manufacturing cell. International Journal of Production Research, 29, 1923-1939.
17. Mahmoodi, F., Dooley, K. J., and Starr, P. J., 1990, An investigation of dynamic group scheduling heuristics in a job shop manufacturing cell. International Journal of Production Research, 28, 1695-1711.
18. Mahmoodi, F., Tierney, E. J., and Mosier, C. T., 1992, Dynamic group scheduling heuristics in a flow-through cell environment, Decision Science, 23, 61-85.
19. Monma, C., and Potts, C. N., 1989, On the complexity of scheduling with batch set-up times. Operations Research, 37, 798-804.
20. Morris, J. S., and Tersine, R J., 1989, A comparison of cell loading practices in group technology. Journal of M anifacturing and Operations Management, 2, 299-313.
21. Ovacik, I. M, and Uzsoy, R., 1994, Rolling horizon algorithms for a single machine dynamic scheduling problem with sequence-dependent set-up times. International Journai of Production Research, 32, 1243-1263.
22. Picard, J. C., and Queyranne, M, 1978, The time-dependent traveling salesman problem and its application to the tardiness problem in one machine scheduling. Operations Research, 26, 86-110.
23. Prabhakar, T. A., 1974, Production scheduling problem with sequencing considerations. Management science, 21, 34-42.
24. Randhawa, S. U., and Smth, T. A., 1995, An experimental investigation of scheduling non-identical, parallel processors with sequence-dependent set-up times and due-dates. International Journal of Production Research, 33, 59-69.
25. Rubin, P. A., and Ragatz, G. L., 1995, Scheduling in a sequence dependent setup environment with genetic search. Computers and Operations Research, 22, 85-89.
26. Simdnsjr, J. V., 1992, Heuristics in flow shop scheduling with sequence dependent setup times. Omega international Journal of Management Science, 20, 215-225.
27. Srikar, B. N., and Ghosh, S., 1986, A MILP model for n-job, m-stage flowshop with sequence dependent setup time. International Journal of Production Research, 24, 1459-1474.
28. Wein, L. M, 1988, Scheduling semiconductor wafer fabrication. IEEE Transactions on Semiconductor Manufacturing, 1, 115-130.
29. Wein, L. M, 1990, Scheduling networks of queues: heavy traffic analysis of two-station network with controllable inputs. Operations Research, 38, 1065-1078.
30. White, C. H., and Wilson, R. C., 1977, Sequence dependent set-up times and job sequencing. International Journal of Production Research, 15, 191-201.
31. Zhou, C., and Egbelu, P. J., 1989, Scheduling in a manufacturing shop with sequence-dependent setups. Robotics and Computer-Integrated Manufacturing, 5, 73-81.