Branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints

European Journal of Operational Research

Volumn 123, Issue 3, 2000, Pages 504-518

  Park, Moon Won ^a   Kim, Yeong Dae ^b  

^a Chonbuk National University   (South Korea)

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASSEMBLY; CONSTRAINT THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION; RELAXATION PROCESSES;

BRANCH AND BOUND ALGORITHMS; PRODUCTION SCHEDULING PROBLEM;

PRODUCTION CONTROL;

EID: 0033736797     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00108-3     Document Type: Article

References (18)

1. Chen T.R., Hsia T.C. Scheduling for IC sort and test facilities with precedence constraints via Lagrangian relaxation. Journal of Manufacturing Systems. 16:1997;117-128.
2. Clark A.J., Scarf H. Optimal policies for a multi-echelon inventory problem. Management Science. 6:1960;475-490.
3. Czerwinski C.S., Luh P.B. Scheduling products with bill of materials using an improved Lagrangian relaxation technique. IEEE Transactions on Robotics and Automation. 10:1994;99-111.
4. Fisher M.L. The Lagrangian relaxation method for solving integer programming problem. Management Science. 27:1981;1-18.
5. Fisher M.L. An applications oriented guide to Lagrangian relaxation. Interfaces. 15:1985;10-21.
6. Geoffrion A.M. Lagrangian relaxation for integer programming. Mathematical Programming Study. 2:1974;82-114.
7. Hastings N.A.J., Yeh C.-H. Job oriented production scheduling. European Journal of Operational Research. 47:1990;35-48.
8. Hariri A.M.A., Potts C.N. A branch and bound algorithm for the two-stage assembly scheduling problem. European Journal of Operational Research. 103:1997;547-556.
9. Hoogeveen J.A., van de Velde S.L. Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems. Mathematical Programming. 70:1995;173-190.
10. Hoogeveen H., van de Velde S. Scheduling by positional completion times: Analysis of a two-stage flow shop problem with batching machine. Mathematical Programming. 82:1998;273-289.
11. Kim Y.-D. On the superiority of a backward approach in list scheduling algorithms for multi-machine makespan problems. International Journal of Production Research. 25:1987;1751-1759.
12. Kim Y.-D. A backward approach in list scheduling algorithms for multi-machine tardiness problems. Computers and Operations Research. 22:1995;307-319.
13. Lalsare P., Sen S. Evaluating backward scheduling and sequencing rules for an assembly shop environment. Production and Inventory Management Journal. 36:1995;71-78.
14. Lee C.Y., Cheng T.C.E., Lin B.M.T. Minimizing the makespan in the 3-machine assembly type flowshop scheduling problem. Management Science. 39:1993;616-625.
15. Luh P.B. Scheduling of manufacturing systems using the Lagrangian relaxation technique. IEEE Transactions on Automatic Control. 38:1993;1066-1079.
16. Park, M.-W., Kim, Y.-D., 1999. A heuristic algorithm for a production scheduling problem in an assembly system, Journal of the Operational Research Society 50, 138-147.
17. Potts C.N., Sevast'janov S.V., Strusevich V.A., Van Wassenhove L.N., Zwaneveld C.M. The two-stage assembly scheduling problem: Complexity and approximation. Operations Research. 43:1995;346-355.
18. Smith W.L. Various optimizers for single stage production. Naval Research Logistics Quarterly. 3:1956;59-66.