A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups

Authors:
In-Chan Choi;Dae-Sik Choi
Affiliations:
Department of Industrial Systems and Information Engineering, Korea University, 1,5 Ka Anamdong, Seongbukku, Seoul 136, South Korea;Department of Industrial Systems and Information Engineering, Korea University, 1,5 Ka Anamdong, Seongbukku, Seoul 136, South Korea
Venue:
Computers and Industrial Engineering
Year:
2002

Citing 6
Cited 3

The shifting bottleneck procedure for job shop scheduling

Management Science
Job shop scheduling by simulated annealing

Operations Research
A genetic algorithm for the job shop problem

Computers and Operations Research - Special issue on genetic algorithms
Mathematical programming for the scheduling problem with alternate process plans in FMS

ICC&IE-94 Selected papers from the 16th annual conference on Computers and industrial engineering
A production planning model for flexible manufacturing systems with setup cost consideration

ICC&IE '94 Proceedings of the 17th international conference on Computers and industrial engineering
A fast taboo search algorithm for the job shop problem

Management Science

A high performing metaheuristic for job shop scheduling with sequence-dependent setup times

Applied Soft Computing
Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm

Expert Systems with Applications: An International Journal
Application of graph search and genetic algorithms for the single machine scheduling problem with sequence-dependent setup times and quadratic penalty function of completion times

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Alternative operation sequences and sequence-dependent setups are two important factors that frequently appear in various manufacturing environments and in project scheduling. This paper addresses a jobshop scheduling problem with these factors simultaneously considered. In it, a mixed integer program model of the problem is presented, along with a local search scheme. The local search scheme utilizes a property identified to reduce computation time. In addition, a property that establishes a performance bound is presented. Results from a comparative computational study using benchmark data show that the scheme significantly enhances the performance of several greedy-based dispatching rules for the problem under consideration.