Integrated lot-sizing and scheduling for just-in-time production of complex assemblies with finite set-ups

International Journal of Production Research

Volumn 35, Issue 5, 1997, Pages 1447-1470

  Anwar, M F ^a   Nagi, R ^a  

^a the State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER INTEGRATED MANUFACTURING; COST EFFECTIVENESS; HEURISTIC METHODS; INVENTORY CONTROL; ITERATIVE METHODS; JUST IN TIME PRODUCTION; NONLINEAR PROGRAMMING; SCHEDULING; STRATEGIC PLANNING;

INTEGRATED LOT SIZING;

FLEXIBLE MANUFACTURING SYSTEMS;

EID: 0031147439     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075497195416     Document Type: Article

References (49)

1. Adams, J., Balas, E., and Zawak, D., 1988, The shifting bottleneck procedure for job shop scheduling. Management Science, 34 (4), 391 -401.
2. Afentakis, P., Gavish, B., and Karmarkar, U., 1984, Computationally efficient optimal solutions to the lot-sizing problem in multistage assembly systems. Management Science, 30 (2), 222-239.
3. Agrawal, A., Harhalakis, G., Minis, I., and Nagi, R., 1996, Just-in-time production of large assemblies. IIE Transactions, 28, 653-667.
4. Ashour, S., 1967, A decomposition approach for the machine scheduling problem. InternationalJournal of Production Research, 6 (2), 109-122.
5. Ashour, S., and Hiremath, S. R., 1973, A branch and bound approach to the job shop scheduling problem. International Journal of Production Research, 11 (1), 47-58.
6. Baker, J. R., and McMohan, G. B., 1985, Scheduling the general job shop. Management Science, 35 (2), 164-176.
7. Baker, K., Dixon, P., Magazine, M., and Silver, E., 1978, An algorithm for the dynamic lot size problem with time-varying production capacity constraint. Management Science, 24 (16), 1710-1720.
8. Billington, P. J., McClain, J. O., and Thomas, L. J., 1983, Mathematical programming approaches to capacity-constrained MRP systems: review, formulation and problem reduction. Management Science, 29 (10), 1126-1137.
9. Blackburn, J. D., and Millen, R. A., 1982, Improved heuristic for multi-stage requirements planning systems. Management Science, 28 (1), 44-56.
10. Blazewicz, J., Dror, M., and Weglarz, J., 1991, Mathematical programming formulations for machine scheduling: A survey. European Journal of Operational Research, 51 (3), 283- 300.
11. Carlier, J., and Pinson, E., 1989, An algorithm for solving the job shop problem. Management Science, 35 (2), 164-176.
12. Chung, C.-S., Flynn, J., and Lin, C.-H. M., 1994, An effective algorithm for the capacitated single item lot size problem. European Journal of Operational Research, 75(3), 427-440.
13. Coleman, B. J., and McKnew, M. A., 1990, A technique for order placement and sizing. Journal of Purchasing and Material Management, 26 (2), 32-40.
14. Coleman, B. J., and McKnew, M. A., 1991, An improved heuristic for multilevel lot sizing in material requirement planning. Decision Sciences, 22 (1), 116-156.
15. Crowston, W. B., and Wagner, M. H., 1973, Dynamic lot size models for multi-stage assembly systems. Management Science, 20 (1), 14-21.
16. Crowston, W. B., Wagner, M. H., and William, J. F., 1973, Econometric lot size determination in multi-stage assembly systems. Management Science, 19 (5), 517-527.
17. Dauzere-Peres, S., and Lasserre, J.-B., 1994, Integration of lotsizing and scheduling decisions in a job-shop. European Journal of Operational Research, 75 (3), 413-426.
18. Delporate, C., and Thomas, J., 1977, Lot sizing and sequencing for N products on one facility. Management Science, 23 (10), 1070-1079.
19. DeMatteis, J. J., 1968, An economic lot sizing technique: the part period algorithm. IBM Systems Journal, 7 (1), 30- 38.
20. Dixon, p., and Silver, E. A., 1981, A heuristic solution procedure for the multi-item singlelevel, limited-capacity, lot-sizing problem. Journal of Operations Management, 2 (1), 23-39.
21. Elmaghraby, s., 1978, The economic lot scheduling problem (ELSP): review and extension. Management Science, 24 (6), 587-598.
22. Godin, V., and Jones, C., 1969, The Interactive Shop Supervisor. Industrial Engineering, November, 16-22.
23. Goldratt, E., 1980, Optimized production time table: a revolutionary program for industry. Proceedings of the APICS 23rd Annual Conference.
24. Greenberg, H. H., 1968, A branch and bound solution for general scheduling problem. Operations Research, 16 (2), 353-361.
25. Karmarkar, U. S., 1987, Lot sizes, lead time and inprocess inventories. Management Science, 33 (3), 409-418.
26. Karmarkar, U. S., 1989, Capacity loading and release planning with work-in-progress (WIP) and lead time. Journal of Manufacturing and Operations Management, 2 (2), 105-123.
27. Kirca, O., 1990, An efficient algorithm for the capacitated single-item dynamic lot sizing problem. European Journal of Operational Research, 45 (1), 15-24.
28. Kirca, O., and Kokten, M., 1994, A new heuristic approach for the multi-item dynamic lot sizing problem. European Journal of Operational Research, 75 (2), 332-341.
29. Lageweg, B. J., Lenstra, J. K., and Rinnooy, Kan A. H. D., 1977, Job shop scheduling by implicit enumeration. Management Science, 24 (4), 441-450.
30. Lambrecht, M., VanderEecken, j., and Vanderveken, H., 1979, Heuristic procedures forthe single operation, multi-item loading problem. AIIE Transactions, 11, 319-326.
31. Lenstra, J. K., and Rinnooy, Kan A. H. D., 1979, Computational complexity of discrete optimization problems. Annals of Discrete Mathematics, 4, 121-140.
32. Levulis, R. J., 1985, Finite capacity scheduling and simulation systems. Report MTIAC TA-85-04, Manufacturing Technology Information Analysis Center, Chicago, Illinois.
33. Love, S. F., 1979, Inventory Control (New York: McGraw-Hill).
34. McCarthy, B. L., and Liu, j., 1993, Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling. International Journal of Production Research, 31 (1), 55-79.
35. Miltenburg, j., and Sinnamon, G., 1989, Scheduling mixed model, multi-level just-in-time production systems. International Journal of Production Research, 27 (9), 187-209.
36. Miltenburg, j., and Sinnamon, G., 1992, Algorithms for scheduling multi-level just-in-time production systems. IIE Transactions, 24 (2), 121 - 130.
37. Orlicky, J., 1975, Material Requirement Planning (New York: McGraw-Hill).
38. Panwalker, S. S., and Iskander, W., 1977, A survey of scheduling rules. Operations Research, 25 (1), 45-61.
39. Reiter, s., 1968, A system for managing job shop production. Journal of Business, 39 (3), 371- 393.
40. Rodammer, F. A., and White, K. P. Jr., 1988, A recent survey of production scheduling. AIIE Transactions, 18 (6), 841-851.
41. Schniederjans, M. J., 1993, Topics in Just-in-Time Management (Boston, MA: Allyn and Baion).
42. Silver, E. A., and Meal, H. C., 1973, A heuristic for selecting lot-size quantities for the case of a deterministic time-varying demand rate and discrete opportunities for replenishment. Production and Inventory Management, 14 (2), 64-77.
43. Steinberg, E., and Napier, H. A., 1980, Optimal multi-level lot sizing for requirements planning systems. Management Science, 26 (12), 1258-1271.
44. Tempelmeier, H., and Helber, s., 1994, A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structure. European Journal of Operational Research, 75 (2), 296-311.
45. Wagner, H. M., and Whitin, T. M., 1958, Dynamic version of economic lot size model. Management Science, 5 (1), 89-96.
46. Zahorik, A., Thomas, L. J., and Trigeiro, W. W., 1984, Network programming models for production scheduling in multi-stage multi-item capacitated system. Management Science, 30 (3), 308-325.
47. Zangwill, W. I., 1968, Minimum concave cost flows in certain networks. Management Science, 14 (7), 429-450.
48. Zangwill, W. I., 1969, A backlogging model and a multi-echelon model of a dynamic lot size production system-a network approach. Management Science, 15 (9), 506-527.
49. Zangwill, W. I., 1977, A deterministic multiproduct, multifacility production and inventory model. Operations Research, 14 (3), 486-507.