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

Cited 21 time in webofscience Cited 0 time in scopus
  • Hit : 701
  • Download : 161
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.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2000-06
Language
English
Article Type
Article
Keywords

LAGRANGIAN-RELAXATION TECHNIQUE; MACHINE

Citation

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.123, no.3, pp.504 - 518

ISSN
0377-2217
DOI
10.1016/S0377-2217(99)00108-3
URI
http://hdl.handle.net/10203/7699
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 21 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0