Please use this identifier to cite or link to this item:
|Title:||Planning production on a single processor with sequence-dependent setups part 1: Determination of campaigns|
|Authors:||Oh, H.-C. |
|Citation:||Oh, H.-C., Karimi, I.A. (2001-08-15). Planning production on a single processor with sequence-dependent setups part 1: Determination of campaigns. Computers and Chemical Engineering 25 (7-8) : 1021-1030. ScholarBank@NUS Repository.|
|Abstract:||Production planning of processors located within in a facility or distributed across facilities is a routine and crucial industrial activity. So far, most attempts at this have treated planning horizon as a decision variable, and have limited their scope to sequence-independent setups. In this two-part paper, we present a new and improved methodology for solving the single machine economic lot scheduling problem (ELSP) with sequence-dependent setups and a given planning horizon. We decompose the entire complex problem into two subproblems; one involving lot sizing and the other involving lot sequencing and scheduling. In this part, we present a novel mixed integer nonlinear programming (MINLP) formulation for the lot-sizing problem. Using a multi-segment separable programming approach, we transform this MINLP into a MILP and propose one rigorous and two heuristic algorithms for the latter. Based on a thorough numerical evaluation using randomly simulated large problems, we find that our best heuristic gives solutions within 0.01% of the optimal on an average and in much less time than the optimal algorithm. Furthermore, it works equally well on problems with sequence-independent setups. Overall, our methodology is well suited for real-life large-scale industrial problems. © 2001 Elsevier Science Ltd. All rights reserved.|
|Source Title:||Computers and Chemical Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 7, 2018
WEB OF SCIENCETM
checked on May 8, 2018
checked on May 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.