Scheduling models for setup reduction

Journal of Manufacturing Science and Engineering, Transactions of the ASME

Volumn 119, Issue 4, 1997, Pages 571-579

  Feng, Chang Xue ^a   Kusiak, Andrew ^b   Huang, Chun Che ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; CRITICAL PATH ANALYSIS; LINEAR PROGRAMMING; MANUFACTURE; MATHEMATICAL MODELS;

FACTORIAL ANALYSIS; INTERNAL SETUP TIME; SCHEDULING MODELS;

SCHEDULING;

EID: 0031271493     PISSN: 10871357     EISSN: 15288935     Source Type: Journal    
DOI: 10.1115/1.2831189     Document Type: Article

References (32)

1. Black, J., 1991, The Design of the Factory with a Future, McGraw-Hill, New York.
2. Burgess, A., Morgan, I., and Vollmann, T., 1993, “Cellular Manufacturing: Its Impacts on the Total Factory,” International Journal of Production Research, Vol. 31, No. 8, pp. 2059-2077.
3. Chand, S., 1989, “Lot Sizes and Setup Frequency with Learning in Setups and Process Quality,” European Journal of Operational Research, Vol. 42, No. 2, pp. 190-202.
4. Chand, S., and Sethi, S., 1990, “A Dynamic Lot Sizing Model with Learning in Setups,” Operations Research, Vol. 38, No. 4, pp. 644-655.
5. Christofides, N., Alvarez, R., and Tamarit, J., 1987, “Project Scheduling with Resource Constraints: Branch and Bound Approach,” European Journal of Operational Research, Vol. 29, No. 3, pp. 262-273.
6. Dahel, N., and Smith, S., 1993, “Designing Flexibility into Cellular Manufacturing Systems,” International Journal of Production Research, Vol. 31, No. 4, pp. 933-945.
7. Davis, E., and Patterson, H., 1975, “A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling,” Management Science, Vol. 21, No. 7, pp. 944-955.
8. Dobson, G., 1992, “The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups,” Operations Research, Vol. 40, No. 4, pp. 736-749.
9. Elmaghraby, S., 1977, Activity Networks; Project Planning and Control by Network Models, John Wiley, New York.
10. Elmaghraby, S., and Kamburowski, J., 1992, “The Analysis of Activity Networks under Generalized Precedence Relations (GPRs),” Management Science, Vol. 38, No. 8, pp. 1245-1263.
11. Flynn, 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, Vol. 7, No. 1, pp. 203-216.
12. Foo, F., and Wager, J., 1983, “Set-up Times in Cyclic and Acyclic Group Technology Scheduling Systems,” International Journal of Production Research, Vol. 21, No. 1, pp. 63-73.
13. Gallego, G., and Moon, I., 1992, “The Effect of Externalizing Setups in the Economic Lot Scheduling Problem,” Operations Research, Vol. 40, No. 3, pp. 614-619.
14. Hall, R., 1983, Zero Inventories, Dow Jones-Irwin, Homewood, IL.
15. Hillier, F., and Lieberman, G., 1990, Introduction to Operations Research, Fifth Edition, McGraw-Hill, New York.
16. Hitomi, K., and Ham, I., 1977, “Group Scheduling Techniques for Multiproduct, Multistage Manufacturing Systems,” ASME Journal of Engineering for Industry, 99B(3), pp. 759-765.
17. Horowitz, E., and Sahni, S., 1984, Fundamentals of Data Structure with Pascal, Computer Science Press, Rockville, MD.
18. Inman, R., Jones, P., and Gallego, G., 1991, “Economic Lot Scheduling of Fully Loaded Processes with External Setups,” Naval Research Logistics, Vol. 38, No. 5, pp. 699-713.
19. Jordan, P., and Frazier, G., 1993, “Is The Potential of Cellular Manufacturing Being Achieved?” Production and Inventory Management Journal, Vol. 34, No. 1, pp. 70-72.
20. Karwan, K., Mazzola, J., and Morey, R., 1988, “Production Lot Sizing under Setup and Worker Learning,” Naval Research Logistics, Vol. 35, No. 2, pp. 159-175.
21. Kelley, J., Jr., 1961, “Critical Path Planning and Scheduling: Mathematical Basis,” Operations Research, Vol. 9, No. 3, pp. 296-320.
22. Kelly, J., Jr. and Walker, J., 1959, “Critical Path Planning and Scheduling,” Proceedings of Eastern Joint Computer Conference, pp. 160-173.
23. Leachman, R., and Kim, S., 1993, “A Revised Critical Path Method for Networks Including both Overlap Relationships and Variable-Duration Activities,” European Journal of Operational Research, Vol. 64, No. 2, pp. 229-248.
24. Montgomery, D., 1991, Design and Analysis of Experiments, Third Edition, John Wiley, New York.
25. Premachandra, I., 1993, “A Goal-Programming Model for Activity Crashing in Project Networks,” International Journal of Operations & Production Management, Vol. 13, No. 6, pp. 79-85.
26. Schrage, L., 1984, Linear, Integer and Quadratic Programming with LINDO, Scientific Press, Palo Alto, CA.
27. Shingo, S., 1985, A Revolution in Manufacturing: The SMED System, Productivity Press, Stamford, CT.
28. Steudel, H., and Desruelle, P., 1991, Manufacturing in the Nineties: How to Become a Mean, Lean, World-Class Competitor, Van Nostrand Reinhold, New York.
29. Talbot, F., 1982, “Resource-Constrained Project Scheduling with Time Resource Tradeoffs: The Nonpreemptive Case,” Management Science, Vol. 28, No. 10, pp. 1197-1210.
30. Trevino, J., Hurley, B., and Friedrich, W., 1993, “A Mathematical Model for the Economic Justification of Setup Time Reduction,” International Journal of Production Research, Vol. 31, No. 1, pp. 191-202.
31. Ulsoy, G., and Ozdamar, L., 1994, “A Constraint-Based Perspective in Resource Constrained Project Scheduling,” International Journal of Production Research, Vol. 32, No. 3, pp. 693-705.
32. Weglarz, J., 1979, “Project Scheduling with Discrete and Continuous Resources,” IEEE Transactions on Systems, Man, and Cybernetics, Vol. 9, No. 10, pp. 644-650.