A New Heuristic for Minimal Makespan in No-Wait Hybrid Flowshops

Author

Junlin Chang ; Guangfu Ma ; Xiaoping Ma

Author_Institution

Coll. of Inf. & Electr. Eng., China Univ. of Min. & Technol., Xuzhou, China

fYear

2006

fDate

7-11 Aug. 2006

Firstpage

1352

Lastpage

1356

Abstract

The no-wait hybrid flowshop scheduling problem is studied to minimize the makespan. This class of problem is characterized by the processing of n jobs through m stages with one or more machines at each stage, and there is no-wait restriction between stages. An integer programming model is first formulated. Then the complete scheduling scheme for a given job sequence is built, and a new heuristic based on the scheduling scheme is proposed. Computational experience demonstrates the effectiveness of the heuristic algorithm in finding near optimal schedules.

Keywords

flow shop scheduling; heuristic programming; integer programming; job shop scheduling; heuristic algorithm; integer programming model; job processing; job sequence; makespan minimization; minimal makespan; near optimal schedule; no-wait hybrid flowshop scheduling; no-wait restriction; Chemical industry; Delay; Educational institutions; Electronic mail; Heuristic algorithms; Job shop scheduling; Linear programming; Optimal scheduling; Processor scheduling; Steel; Heuristic; Hybrid flowshop; No-wait; Scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Control Conference, 2006. CCC 2006. Chinese

Conference_Location

Harbin

Print_ISBN

7-81077-802-1

Type

conf

DOI

10.1109/CHICC.2006.280673

Filename

4060305