Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic

Authors:
Xiangyong Li;M. F. Baki;Y. P. Aneja
Affiliations:
School of Economics and Management, Tongji University, Shanghai 200092, China;Odette School of Business, University of Windsor, Windsor, Ontario, Canada N9B 3P4;Odette School of Business, University of Windsor, Windsor, Ontario, Canada N9B 3P4
Venue:
Computers and Operations Research
Year:
2011

Citing 7
Cited 1

One-operator–two-machine flowshop scheduling with setup and dismounting times

Computers and Operations Research
Parallel machine scheduling with a common server

Discrete Applied Mathematics
Scheduling a single server in a two-machine flow shop

Computing
Ant Colony Optimization

Ant Colony Optimization
The hyper-cube framework for ant colony optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Parallel machine scheduling problems with a single server

Mathematical and Computer Modelling: An International Journal
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times

Operations Research Letters

Literature review regarding Ant Colony Optimization applied to scheduling problems: Guidelines for implementation and directions for future research

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper studies the one-operator m-machine flow shop scheduling problem with the objective of minimizing the total completion time. In this problem, the processing of jobs and setup of machines require the continuous presence of a single operator. We compare three different mathematical formulations and propose an ant colony optimization based metaheuristic to solve this flow shop scheduling problem. A series of experiments are carried out to compare the properties of three formulations and to investigate the performance of the proposed ant colony optimization metaheuristic. The computational results show that (1) an assignment-based formulation performs best, and (2) the ant colony optimization based metaheuristic is a computationally efficient algorithm.