Lagrangean relaxation approach to joint optimization for production planning and scheduling of synchronous assembly lines
Yu-Wei An and
Hong-Sen Yan
International Journal of Production Research, 2016, vol. 54, issue 22, 6718-6735
Abstract:
This paper focuses on simultaneous optimisation of production planning and scheduling problem over a time period for synchronous assembly lines. Differing from traditional top-down approaches, a mixed integer programming model which jointly considers production planning and detailed scheduling constraints is formulated, and a Lagrangian relaxation method is developed for the proposed model, whereby the integrated problem is decomposed into planning, batch sequencing, tardiness and earliness sub-problems. The scheduling sub-problem is modelled as a time-dependent travelling salesman problem, which is solved using a dynasearch algorithm. A proposition of Lagrangian multipliers is established to accelerate the convergence speed of the proposed algorithm. The average direction strategy is employed to solve the Lagrangian dual problem. Test results demonstrate that the proposed model and algorithm are effective and efficient.
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2016.1157271 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:54:y:2016:i:22:p:6718-6735
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20
DOI: 10.1080/00207543.2016.1157271
Access Statistics for this article
International Journal of Production Research is currently edited by Professor A. Dolgui
More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().