197 0

A hierarchical approach for the capacitated lot-sizing and scheduling problem with a special structure of sequence-dependent setups

Title
A hierarchical approach for the capacitated lot-sizing and scheduling problem with a special structure of sequence-dependent setups
Author
정인재
Keywords
capacitated lot-sizing; sequence-dependent; two-level hierarchical plan
Issue Date
2011-12
Publisher
Taylor & Francis
Citation
Current trends in theory and practice of computer science; SOFSEM 2012, pp.7425 - 7439
Abstract
This research deals with the single machine multi-product capacitated lot-sizing and scheduling problem (CLSP) with sequence-dependent setup times and setup costs. The CLSP determines the production quantities and the sequence to satisfy deterministic and dynamic demand during multiple periods. The objective is to minimise the total sum of the inventory holding costs and the sequence-dependent setup costs. We consider a special form of sequence-dependent setup times where the larger product we produce next, the more setup time we need. As a solution approach, we propose a two-level hierarchical method consisting of upper-level planning and the lower-level planning. In the upper-level planning, we solve the lot-sizing problem with estimated sequence-independent setup times utilising the characteristic of the special structure of setup times. Then we solve the scheduling problem in the lower-level planning. The proposed method is compared with the single-level optimal CLSP solution and an existing heuristic developed for the uniform structure of setup times. [ABSTRACT FROM PUBLISHER]
URI
https://www.tandfonline.com/doi/abs/10.1080/00207543.2010.543170http://hdl.handle.net/20.500.11754/65863
ISSN
0020-7543
DOI
10.1080/00207543.2010.543170
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > INDUSTRIAL ENGINEERING(산업공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE