Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/64309
Title: Novel MILP models for scheduling permutation flowshops
Authors: Pitty, S.S.
Karimi, I.A. 
Keywords: batch process
flowshop
scheduling
Issue Date: 4-Feb-2008
Citation: Pitty, S.S., Karimi, I.A. (2008-02-04). Novel MILP models for scheduling permutation flowshops. Chemical Product and Process Modeling 3 (1) : -. ScholarBank@NUS Repository.
Abstract: Flowshop scheduling via mixed integer linear programming (MILP) has received considerable attention in the past four decades. However, alternate models are limited; most numerical studies have used small problem sizes. A need for good model evaluation methodology exists; and limited work exists on flowshops with no intermediate storage. This paper presents a classification of flowshops and MILP scheduling models, and addresses some of these issues. It develops a host of new MILP formulations for minimizing makespan in a permutation flowshop with no storage and with or without unit setups. It presents some useful insights into model building by employing a variety of new and old binary variables and coupling them creatively. In contrast to previous work, it evaluates a range of new and existing MILP models using many larger test problems with no or unlimited intermediate storage, and presents a reliable procedure to rank various models based on problems with varying data and sizes. It shows that the top models for the two flowshops indeed show slightly different computational performance. © 2008 Berkeley Electronic Press. All rights reserved.
Source Title: Chemical Product and Process Modeling
URI: http://scholarbank.nus.edu.sg/handle/10635/64309
ISSN: 19342659
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

8
checked on Apr 13, 2019

WEB OF SCIENCETM
Citations

4
checked on Apr 17, 2019

Page view(s)

56
checked on May 23, 2019

Google ScholarTM

Check


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