A stochastic strategy for solving job shop scheduling problem

Author

Yin, Ai-Hua ; Wen-Qi Huang

Author_Institution

Sch. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China

Volume

1

fYear

2002

fDate

2002

Firstpage

434

Abstract

A computationally effective heuristic algorithm for finding the minimum make-span problem of job shop scheduling is presented. The proposed local search method is based on a new tabu search technique and on a modification of an improved shifting bottleneck procedure with a stochastic strategy. Computational experiments show that our algorithm finds shorter make-span than some typical approximation approaches discussed in the literatures.

Keywords

directed graphs; minimisation; production control; search problems; stochastic programming; computational experiments; computationally effective heuristic algorithm; directed acyclic graph; job shop scheduling problem; local search method; make-span minimization; minimum make-span problem; shifting bottleneck procedure; stochastic strategy; tabu search technique; Approximation algorithms; Computer science; Heuristic algorithms; Iterative algorithms; Job shop scheduling; Mathematical model; Processor scheduling; Scheduling algorithm; Search methods; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

Machine Learning and Cybernetics, 2002. Proceedings. 2002 International Conference on

Print_ISBN

0-7803-7508-4

Type

conf

DOI

10.1109/ICMLC.2002.1176791

Filename

1176791