LAPSE:2020.1055
Published Article
LAPSE:2020.1055
Capacitated Lot-Sizing Problem with Sequence-Dependent Setup, Setup Carryover and Setup Crossover
October 26, 2020
Since setup operations have significant impacts on production environments, the capacitated lot-sizing problem considering arbitrary length of setup times helps to develop flexible and efficient production plans. This study discusses a capacitated lot-sizing problem with sequence-dependent setup, setup carryover and setup crossover. A new mixed integer programming formulation is proposed. The formulation is based on three building blocks: the facility location extended formulation; the setup variables with indices for the starting and the completion time periods; and exponential number of generalized subtour elimination constraints (GSECs). A separation routine is adopted to generate the violated GSECs. Computational experiments show that the proposed formulation outperforms models from the literature.
Record ID
Keywords
branch-and-cut algorithm, capacitated lot-sizing, sequence-dependent setup, setup carryover, setup crossover
Subject
Suggested Citation
Kang J. Capacitated Lot-Sizing Problem with Sequence-Dependent Setup, Setup Carryover and Setup Crossover. (2020). LAPSE:2020.1055
Author Affiliations
Kang J: Department of Industrial Engineering, Chosun University, 309 Pilmun-Daero, Dong-Gu, Gwangju 61452, Korea
Journal Name
Processes
Volume
8
Issue
7
Article Number
E785
Year
2020
Publication Date
2020-07-05
Published Version
ISSN
2227-9717
Version Comments
Original Submission
Other Meta
PII: pr8070785, Publication Type: Journal Article
Record Map
Published Article
LAPSE:2020.1055
This Record
External Link
doi:10.3390/pr8070785
Publisher Version
Download
Meta
Record Statistics
Record Views
456
Version History
[v1] (Original Submission)
Oct 26, 2020
Verified by curator on
Oct 26, 2020
This Version Number
v1
Citations
Most Recent
This Version
URL Here
https://psecommunity.org/LAPSE:2020.1055
Original Submitter
Calvin Tsay
Links to Related Works