Total flow time minimization in a flowshop sequence-dependent group scheduling problem

Authors:
Nasser Salmasi;Rasaratnam Logendran;Mohammad Reza Skandari
Affiliations:
Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran;School of Mechanical, Industrial and Manufacturing Engineering, Oregon State University, 204 Rogers Hall, Corvallis, OR 97331, USA;Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran
Venue:
Computers and Operations Research
Year:
2010

Citing 4
Cited 4

Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups

Computers and Operations Research
Selected Topics in Column Generation

Operations Research
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts

Computers and Industrial Engineering
A novel encoding scheme of PSO for two-machine group scheduling

ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
Sequence-dependent group scheduling problem on unrelated-parallel machines

Expert Systems with Applications: An International Journal
Scheduling Cellular Manufacturing Systems Using ACO and GA

International Journal of Applied Metaheuristic Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We have developed a mathematical programming model for minimizing total flow time of the flow shop sequence dependent group scheduling (FSDGS) problem, typically classified as F"m|fmls, S"p"l"k, prmu|@?C"j. As the problem is shown to be strongly NP-hard, a tabu search (TS) algorithm as well as a hybrid ant colony optimization (HACO) algorithm have been developed to heuristically solve the problem. A lower bounding (LB) method based on the Branch-and-Price algorithm is also developed to evaluate the quality of the metaheuristic algorithms. In order to compare the performance of metaheuristic algorithms, random test problems, ranging in size from small, medium, to large are created and solved by both the TS and the HACO algorithms. A comparison shows that the HACO algorithm has a better performance than the TS algorithm. The results of the heuristic algorithms are also compared with the results of the LB method to evaluate the quality of the solutions. The LB method presented in this paper can be generalized to solve the FSDGS problem with other objective functions.