Sequencing CONWIP flow-shops: Analysis and heuristics

International Journal of Production Research

Volumn 39, Issue 12, 2001, Pages 2735-2749

  Framinan, Jose M ^a   González, Pedro L ^a   Ruiz Usano, Rafael ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMOTIVE INDUSTRY; COMPUTATIONAL COMPLEXITY; COMPUTER INTEGRATED MANUFACTURING; FUNCTION EVALUATION; HEURISTIC METHODS; JOB ANALYSIS; MATHEMATICAL PROGRAMMING; SIMULATED ANNEALING;

BACKLOG SEQUENCING PROBLEM; CONSTANT WORK IN PROCESS; DISPATCHING RULE; FLOW SHOP CONTROL;

PRODUCTION CONTROL;

EID: 0035883114     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540110048972     Document Type: Article

References (46)

1. Amar, A. D. and Gupta, J. N. D., 1986, Simulated versus real life data in testing the efficiency of scheduling algorithms, IIE Transactions, 18, 16-25.
2. Berkley, B. J., 1992, A review of the Kanban production control research literature. Production and Operations Management, 1, 393-411.
3. Bonvik, A. M., Couch, C. and Gershwin, S. B., 1997, A comparison of production-line control mechanisms. International Journal of Production Research, 35, 789-804.
4. Campbell, H. G., Dudek, R. A. and Smith, M. L., 1970, A heuristic algorithm for the n-job, m-machine sequencing problem. Management Science, 16, B630-B637.
5. Chang, T. M. and Yih, Y., 1994, Generic kanban system for dynamic environment. International Journal of Production Research, 32, 889-902.
6. Dannenbring, D. G., 1977, An evaluation of flow-shop sequence heuristics. Management Science, 23, 1174-1182.
7. Dar-El, E. M., Herer, Y. T. and Masin, M., 1999, CONWIP-based production lines with multiple bottlenecks: performance and design implications. IIE Transactions, 31, 99-111.
8. Duenyas, I., 1994, A simple release policy for networks of queues with controllable input. Operations Research, 42, 1162-1171.
9. Dudek, R. A. and Teuton, O. F., 1964, Development of m stage decision rule for scheduling n jobs through m machines. Operations Research, 12(3).
10. Dutta, S. K. and Cunningham, A., 1975, Sequencing two-machine flow-shops with finite intermediate storage. Management Science, 21, 989-996.
11. Framinan, J. M., Ruiz-Usano, R. and Leisten, R., 2000, Input control and dispatching rules in a dynamic CONWIP flow-shop. International Journal of Production Research, 38, 4589-4598.
12. Framinan, J. M., Ruiz-Usano, R. and Leisten, R., 1998, Sequencing CONWIP flowshops, Technical Report 15/98, University of Greifswald, Germany.
13. Golany, B., Dar-El, E. M. and Zeev, N., 1999, Controlling shop floor operations in a multi-family, multi-cell manufacturing environment through constant work-in-process, IIE Transactions, 31, 771-781.
14. Graham, R. L., Lawler, E. L., Lenstra, J. K. and Rinnooy Kan, A. H. G., 1979, Optimisation and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics, 5, 287-326.
15. Gstettner, S. and Kuhn, H., 1996, Analysis of production systems kanban and CONWIP. International Journal of Production Research, 34, 3253-3273.
16. Gupta, J. N. D., 1971, A functional heuristic algorithm for the flow-shop scheduling problem. Operational Research Quarterly, 22, 39-47.
17. Gupta, J. N. D. and Dudek, R. A., 1971, Optimality criteria for flow-shop scheduling. AIIE Transactions, 3, 199-205.
18. Hall, N. G. and Sriskandarajah, C., 1996, A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44, 510-525.
19. Herer, Y. T. and Masin, M., 1997, Mathematical programming formulation of CONWIP based production lines and relationships to MRP. International Journal of Production Research, 35, 1067-1076.
20. Ho, J. C. and Chang, Y. L., 1991, A new heuristic for the n-job, m-machine flow-shop problem. European Journal of Operational Research, 52, 194-202.
21. Hopp, W. J. and Spearman, M. L., 1996, Factory Physics (Chicago, USA: Irwin).
22. Hopp, W. J., Spearman, M. L. and Duenyas, I., 1993, Economic Production Quotas for pull manufacturing systems. IIE Transactions, 25, 71-79.
23. Lambrecht, M. and Seagert, A., 1990, Buffer stock allocation in serial and assembly type of production lines. International Journal on Production Management, 10, 47-61.
24. Leisten, R., 1990, Flow-shop sequencing problems with limited buffer storage. International Journal of Production Research, 28, 2085-2100.
25. Logendran, R. and Sriskandarajah, C., Two-machine group scheduling problem with blocking and anticipatory set-ups. European Journal of Operational Research, 69, 467-481.
26. 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-936.
27. Morton, T. E. and Pentico, D. W., 1993, Heuristic Scheduling Systems (New York: Wiley Interscience).
28. Nawaz, M., Enscore, E. E., and Ham, I., 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA, 11, 91-95.
29. Palmer, D. S., 1965, Sequencing jobs through a multistage process in the minimum total time: a quick method of obtaining a near-optimum. Operational Research Quarterly, 16, 101-107.
30. Panwalkar, S. S., Dudek, R. A. and Smith, M. L., 1973, Sequencing research and the industrial scheduling problem. Proceedings of the Symposium on Theory of Scheduling and its Applications, New York, pp. 29-38.
31. Papadimitriou, C. and Kanellakis, P., 1980, Flow-shop scheduling with limited temporary stage. Journal of the Association for Computing Machinery, 27, 533-549.
32. Pinedo, M., 1995, Scheduling: Theory, Algorithms and Systems (Englewood Cliffs, NJ: Prentice Hall).
33. Reddi, S. S., 1976, Sequencing with intermediate storage. Management Science, 23, 216-217.
34. Reddi, S. S. and Ramamoorthy, C. V., 1972, On the flow-shop sequencing problem with no wait in process. Operational Research Quarterly, 23, 323-331.
35. Reeves, C. R., 1995, A genetic algorithm for flow-shop sequencing. Computers Operational Research, 22, 5-13.
36. Schonberger, R. J., 1984, World Class Manufacturing: the Lessons of Simplicity Applied (New York: The Free Press).
37. Sharadapriyadarshini, B. and Rajendran, C., 1997, Scheduling in a kanban controlled flow-shop with dual blocking mechanism and missing operations for part-types. International Journal of Production Research, 35, 3133-3156.
38. Spearman, M. L. and Zazanis, M. A., 1992, Push and pull production systems: issues and comparisons. Operations Research, 40, 521-532.
39. Spearman, M. L., Woodruff, D. L. and Hopp, W. J., 1990, CONWIP: a pull alternative to kanban. International Journal of Production Research, 28, 879-894.
40. Spearman, M. L., Hopp, W. J. and Woodruff, D. L., 1989, A hierarchical control architecture for Constant Work-In-Process (CONWIP) production systems. Journal of Manufacturing and Operations Management, 2, 147-171.
41. Taillard, E., 1990, Some efficient heuristic methods for the flow-shop sequencing problem. European Journal of Operational Research, 47, 65-74.
42. Taillard, E., 1993, Benchmark for basic scheduling problems. European Journal of Operational Research, 64, 278-285.
43. Tardiff, V., 1995, Detecting scheduling infeasibilities in multi-stage, finite capacity production environments, Ph.D. Thesis, Northwestern University, USA.
44. Wismer, D. A., 1972, Solution of the flow-shop sequencing problem with no intermediate queue. Operations Research, 20, 689-697.
45. Woodruff, D. L. and Spearman, M. L., 1992, Sequencing and batching for two classes of jobs with due dates and set-up times. Journal of Production and Operations Management, 1, 87-102.
46. Zegordi, S. H., Itoh, K. and Enkawa, T., 1995, Minimizing makespan for flow-shop scheduling by combining simulated annealing with sequencing knowledge. European Journal of Operational Research, 85, 515-531.