A Genetic Algorithm for Makespan Minimization in a No-wait Flow Shop Problem with Two Batching Machines

Author

Jolai, F. ; Kor, H. ; Hatefi, S.M. ; Iranmanesh, H.

Author_Institution

Coll. of Eng., Dept. of Ind. Eng., Univ. of Tehran, Tehran

Volume

2

fYear

2009

fDate

22-24 Jan. 2009

Firstpage

238

Lastpage

242

Abstract

In this paper we consider a scheduling problem where a set of jobs are simultaneously available for processing in a no-wait two-machine flowshop. All jobs are processed on both machines in batches. Batching machines can process several tasks per batch so that all tasks of the same batch start and complete together. The batch processing time for the first machine is equal to the maximal processing time of the tasks in this batch, and for the second machine is equal to the sum of the processing times of the tasks in this batch. The objective is to minimize the makespan, i.e. the maximum completion time of the jobs with using genetic algorithm and finding the best scheduling jobs.

Keywords

batch processing (industrial); flow shop scheduling; genetic algorithms; job shop scheduling; minimisation; genetic algorithm; job shop scheduling; makespan minimization; no-wait flow shop problem; two batching machine; Availability; Delay; Educational institutions; Genetic algorithms; Genetic engineering; Industrial engineering; Job shop scheduling; Manufacturing; Minimization methods; Switches; Batch processing machines; Complexity; Makespan; No-wait flowshop problem; genetic algortihm;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Engineering and Technology, 2009. ICCET '09. International Conference on

Conference_Location

Singapore

Print_ISBN

978-1-4244-3334-6

Type

conf

DOI

10.1109/ICCET.2009.215

Filename

4769596