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

Abstract This paper focuses on a production scheduling problem in a tree-structured assembly system operating on a make-to-order basis. Due dates are considered as constraints in the problem, that is, tardiness is not allowed. The objective of the problem is to minimize holding costs of final product inventory as well as work-in-process inventory. A mixed integer linear programming model is given and a branch and bound (B&B) algorithm based on a Lagrangian relaxation method is developed. In the algorithm, a subgradient method is used for obtaining good lower bounds of subproblems (or partial solutions) while a Lagrangian heuristic is used for upper bounds. Results of computational experiments on randomly generated test problems showed that the B&B algorithm found optimal solutions of problems of moderate sizes in a reasonable amount of computation time.

[1]  van de Sl Steef Velde,et al.  Scheduling by positional completion times , 1995 .

[2]  Peter B. Luh,et al.  Scheduling products with bills of materials using an improved Lagrangian relaxation technique , 1994, IEEE Trans. Robotics Autom..

[3]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[4]  Chung-Yee Lee,et al.  Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem , 1993 .

[5]  Tsung-Rian Chen,et al.  Scheduling for IC sort and test facilities with precedence constraints via lagrangian relaxation , 1997 .

[6]  Chung-Hsing Yeh,et al.  Job oriented production scheduling , 1990 .

[7]  Yeong-Dae Kim,et al.  On the superiority of a backward approach in list scheduling algorithms for multi-machine makespan problems , 1987 .

[8]  M.-W. Park,et al.  A heuristic algorithm for a production planning problem in an assembly system , 1999, J. Oper. Res. Soc..

[9]  Han Hoogeveen,et al.  Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems , 1992, Math. Program..

[10]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[11]  Peter B. Luh,et al.  Scheduling of manufacturing systems using the Lagrangian relaxation technique , 1991, IEEE Trans. Autom. Control..

[12]  Yeong-Dae Kim,et al.  A backward approach in list scheduling algorithms for multi-machine tardiness problems , 1995, Comput. Oper. Res..

[13]  C. Potts,et al.  A branch and bound algorithm for the two-stage assembly scheduling problem , 1997 .

[14]  Chris N. Potts,et al.  The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..