Title

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

Publication Type

Conference Proceeding Article

Publication Date

8-2007

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. A Lagrangian-based heuristics procedure is used to further reduce the duality gap. The performance of the heuristic and Lagrangian relaxation is compared with optimal solutions experimentally.

Keywords

Flow shop, Job shop, Machine capacity, Critical operation sequencing

Discipline

Artificial Intelligence and Robotics | Business | Operations Research, Systems Engineering and Industrial Engineering

Research Areas

Intelligent Systems and Decision Analytics

Publication

IEEE Multi-Conference on Systems and Control

First Page

446

Last Page

451

Identifier

10.1109/ISIC.2007.4450927

Publisher

IEEE

Additional URL

http://dx.doi.org/10.1109/ISIC.2007.4450927

This document is currently not available here.

Share

COinS