Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISIC.2007.4450927
Title: Bidirectional flow shop scheduling with multi-machine capacity and critical operation sequencing
Authors: Zhao, Z.J.
Leong, T.-Y.
Ge, S.S. 
Lau, H.C..
Keywords: Critical operation sequencing
Flow shop
Job shop
Machine capacity
Issue Date: 2008
Citation: Zhao, Z.J.,Leong, T.-Y.,Ge, S.S.,Lau, H.C.. (2008). Bidirectional flow shop scheduling with multi-machine capacity and critical operation sequencing. 22nd IEEE International Symposium on Intelligent Control, ISIC 2007. Part of IEEE Multi-conference on Systems and Control : 446-451. ScholarBank@NUS Repository. https://doi.org/10.1109/ISIC.2007.4450927
Abstract: We study a special bidirectional flow shop problem with multi-machine capacity and sequencing constraints on critical operations. A formulation is proposed in continuous time domain and compared with a mixed integer programming (MIP) formulation in discrete time domain. Of particular interest to us is the formulation of the machine utilization function - both in continuous time and in discrete time domain. Fast heuristics are proposed with the relaxation of the machine capacity. The performance of the heuristic and Lagrangian relaxation are compared with optimal solutions experimentally. © 2007 IEEE.
Source Title: 22nd IEEE International Symposium on Intelligent Control, ISIC 2007. Part of IEEE Multi-conference on Systems and Control
URI: http://scholarbank.nus.edu.sg/handle/10635/69505
ISBN: 142440441X
DOI: 10.1109/ISIC.2007.4450927
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

3
checked on Dec 9, 2018

Page view(s)

40
checked on Nov 24, 2018

Google ScholarTM

Check

Altmetric


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