A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints
Authors:
- Moon-Won ParkMPMoon-Won Park
- Yeong-Dae KimYKYeong-Dae Kim
- 1 June 2000
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 123 (3) , 504-518
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machineMathematical Programming, 1998
- A branch and bound algorithm for the two-stage assembly scheduling problemEuropean Journal of Operational Research, 1997
- Scheduling for IC sort and test facilities with precedence constraints via lagrangian relaxationJournal of Manufacturing Systems, 1997
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problemsMathematical Programming, 1995
- Scheduling products with bills of materials using an improved Lagrangian relaxation techniqueIEEE Transactions on Robotics and Automation, 1994
- Job oriented production schedulingEuropean Journal of Operational Research, 1990
- An Applications Oriented Guide to Lagrangian RelaxationInterfaces, 1985
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Lagrangean relaxation for integer programming1974
- Optimal Policies for a Multi-Echelon Inventory ProblemManagement Science, 1960