A comparison of sequencing rules in static and dynamic hybrid flow systems

International Journal of Production Research

Volumn 35, Issue 5, 1997, Pages 1359-1384

  Kadipasaoglu, S N ^a   Xiang, W ^a,b   Khumawala, B M ^a  

^a UNIVERSITY OF HOUSTON   (United States)

^b CENTRAL SOUTH UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; INDUSTRIAL ECONOMICS; OPERATIONS RESEARCH; PROCESS CONTROL; PRODUCTION CONTROL;

HYBRID FLOW SYSTEMS;

SCHEDULING;

EID: 0031144757     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075497195371     Document Type: Article

References (33)

1. Baker, C. T., and Dzielinski, B. P., 1980, Simulation of a simplified job shop. Management Science, 26(12), 1227-1237.
2. Barrett, R. T., and Barman, S., 1986, A Slam II simulation of a simplified flow shop. Simulation, 47(5), 181-189.
3. Barrett, R. T., and Kadipasaoglu, S. N., 1990, Dispatching rules for a dynamic flow shop. Production and Inventory Management, 31(1), 54-58.
4. Blackstone, J. H. Jr., Phillips, D. T., and Hogg, G. L., 1982, A state-of-the-art survey of dispatching rules for manufacturing job-shop operations. International Journal of Production Research, 20(1), 27-45.
5. Brah, S. A., and Hunsucker, J. L., 1991, Branch and bound algorithm for the flow shop with multiple processors. European Journal of Operational Research, 51, 88-99.
6. Buffa, E. S., 1968, Operations Management: Problems and Models (New York: Wiley).
7. Conway, R. W., and Maxwell, W. L., 1962, Network dispatching by the shortest operation discipline. Operations Research, 10(1), 51-73.
8. Conway, R. W., 1965, Priority dispatching and job lateness in a job shop. Journal of Industrial Engineering, 16(4), 228-237.
9. Day, J. E., and Hottenstein, M. P., 1970, Review of sequencing research. Naval Research Logistics Quarterly, 17(1), 11-36.
10. Elvers, D. A., 1973, Job shop dispatching rules using various delivery date setting criteria. Production and Inventory Management, 14(4), 62-70.
11. Elvers, D. A., 1974, The sensitivity of relative effectiveness of job shop dispatching rules with respect to various arrival distributions. AIIE Transactions, 6(1), 41-49.
12. Elvers, D. A., and Taube, L. R., 1982, Time completion for various dispatching rules in job shops. Omega, 11(1), 81-89.
13. Goldratt, E. M., 1990, Sifting Information Out of the Data Ocean: The Haystack Syndrome (New York: North River Press), pp. 146-147.
14. Gupta, J. N. D., 1988, Two-stage, hybrid flow shop scheduling problem. Journal of Operational Research Society, 39(4), 359-364.
15. Gupta, J. N. D., and Tunc, E. A., 1991, Schedules for a two-stage hybrid flowshop with parallel machines at the second stage. International Journal of Production Research, 29(7), 1489-1502.
16. Jackson, J. R., 1957, Simulation research on job-shop production. Naval Research Logistics Quarterly, 4(4), 287-295.
17. Kadipasaoglu, S. N., Xiang, W., and Khumawala, B. M., 1995, A note on scheduling in hybrid flow systems. International Journal of Production Research, 35(5), 1491-1494.
18. King, J. R., and Spachis, A. S., 1980, Heuristics for flow shop scheduling. International Journal of Production Research, 18(3), 345-357.
19. Kiran, A. S., and Smith, M. L., 1984a, Simulation studies in job-shop scheduling-I, Computers and Industrial Engineering, 8(2), 87-93.
20. Kiran, A. S., and Smith, M. L., 1984b, Simulation studies in job-shop scheduling-II, Computers and Industrial Engineering, 8(2), 95-105.
21. Kotz, S., Johnson, N. L., and Read, C. B., 1983, Encyclopedia of Statistical Sciences (New York: Wiley), 4, 414-416.
22. Malhotra, M. K., Jensen, J. B., and Philipoom, P. R., 1995, Management of vital customer priorities in job-shop manufacturing environments. Decision Sciences, 25(5/6), 711-736.
23. Moore, J. M., and Wilson, R. C., 1967, A review of simulation research in job-shop scheduling. Production and Inventory Management, January, 1-10.
24. Narasimhan, S. L., and Panwalkar, S. S., 1984, Scheduling in a two-stage manufacturing process. International Journal of Production Research, 22, 555-564.
25. Narasimhan, S. L., and Mangiameli, P. M., 1987, A comparison of sequencing rules for atwo-stage hybrid flow shop. Decision Sciences, 18(2), 250-265.
26. Panwalker, S. S., and Iskander, W., 1977, A survey of scheduling rules. Operations Research, 25(1), 45-61.
27. Park, Y. B., 1988, An evaluation of static flow shop scheduling heuristics in dynamic flow shop models via a computer simulation. Computers and Industrial Engineering, 14(2), 103-112.
28. Park, Y. B., Pegden, C. D., and Enscore, E. E., 1984, A survey and evaluation of static flowshop scheduling heuristics. International Journal of Production Research, 22(1), 127-141.
29. Paul, R. J. A., 1979, A production scheduling problem in the glass container industry. Operations Research, 27, 290-302.
30. Petrov, V. A., 1968, Flowline Group Production Planning (London: Business Publications).
31. Sriskandarajah, C., and Sehti, S. P., 1989, Scheduling algorithms for flexible flowshops: worst and average case performance 5. European Journal of Operational Research, 43, 143-160.
32. Tsubone, H., Ohba, M., Takamuki, H., and Miyake, Y. A., 1993, Production scheduling system for a hybrid flow shop: a case study. Omega, 21(2), 205-214.
33. Wittrock, R. J., 1988, An adaptable scheduling algorithm for flexible flow lines. Operations Research, 36(3), 445-453.