期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 123, 期 3, 页码 504-518出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(99)00108-3
关键词
integer programming; optimisation; scheduling; assembly system
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. (C) 2000 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据