A heuristic algorithm for a production planning problem in an assembly system

Journal of the Operational Research Society

Volumn 50, Issue 2, 1999, Pages 138-147

  Park, M W ^a   Kim, Y D ^b  

^a Chonbuk National University   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Heuristics; Production planning

Indexed keywords

ALGORITHMS; ASSEMBLY; HEURISTIC METHODS; MATHEMATICAL MODELS; NONLINEAR EQUATIONS; PRODUCTION ENGINEERING;

HEURISTIC ALGORITHMS; PRODUCTION PLANNING;

COMPUTER AIDED MANUFACTURING;

EID: 0033075592     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600683     Document Type: Article

References (18)

1. Wortman JC, Euwe MJ, Taal M and Wiers VCS (1996). A review of capacity planning techniques within standard software packages. Prod Plan and Control 7: 117-128.
2. Sharma K (1993). Adding intelligence to MRP systems. APICS—The Performance Advantage 3: 53-58.
3. Lalsare P and Sen S (1995). Evaluating backward scheduling and sequencing rules for an assembly shop environment. Prod and Invent Mgmt J 36: 71-78.
4. Hastings NAJ and Yeh C-H (1990). Job oriented production scheduling. Eur J Opns Res 47: 35-48.
5. Kim Y-D (1987). On the superiority of a backward approach in list scheduling algorithms for multi-machine makespan problems. Int J Prod Res 25: 1751-1759.
6. Kim Y-D (1995). A backward approach in list scheduling algorithms for multi-machine tardiness problems. Comp and Opns Res 22: 307-319.
7. Clark AJ and Scarf H (1960). Optimal policies for a multiechelon inventory problem. Mgmt Sci 6: 475-490.
8. Crowstone WB, Wagner M and Williams JF (1973). Economic lot size determination in multi-stage assembly systems. Mgmt Sci 19: 517-527.
9. Schwarz LB and Schrage L (1975). Optimal and system myopic policies for multi-echelon production/inventory assembly systems. Mgmt Sci 21: 1285-1294.
10. Horn WA (1974). Some simple scheduling algorithms. Naval Res Logist Q 21: 177-185.
11. Tanaev VS, Gordon VS and Shafransky YM (1994). Scheduling Theory. Single-Stage Systems. Kluwer Academic Publishers: Dordrecht.
12. Ahuja RK, Magnanti TL and Orlin JB (1983). Network Flows: Theory, Algorithms and Applications. Prentice Hall: New Jersey.
13. Blackstone Jr JH, Phillips DT and Hogg GL (1982). A state-of- the-art survey of dispatching rules of manufacturing job shop operations. Int J Prod Res 20: 27-45.
14. Kim YD (1990). A comparison of dispatching rules for job shops with multiple identical jobs and alternative routings. IntJ Prod Res 28: 953-962.
15. Panwalkar SS and Iskander W (1977). A survey of scheduling rules. Opns Res 25: 45-61.
16. Ramasesh R (1990). Dynamic job shop scheduling: a survey of simulation studies. OMEGA 18: 43-57.
17. Russel RS, Dar-El EM and Taylor III BW (1987). A comparative analysis of the COVERT job sequencing rule using various shop performance measure. Int J Prod Res 25: 1523-1540.
18. Vepsalainen APJ and Morton TE (1987). Priority rules for job shops with weighted tardiness costs. Mgmt Sci 33: 1035-1047.