Bidirectional Flow Shop Scheduling with Multi-Machine Capacity and Critical Operations Sequencing

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...

Full description

Saved in:
Bibliographic Details
Main Authors: ZHAO, ZhengYi, LEONG, Thin Yin, Ge, Shuzhi Sam, LAU, Hoong Chuin
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2007
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/398
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
Be the first to leave a comment!
You must be logged in first