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

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 co...

Full description

Saved in:
Bibliographic Details
Main Authors: Jolai, F., Kor, H., Hatefi, S.M., Iranmanesh, H.
Format: Conference Proceeding
Language:English
Subjects:
Availability
Batch processing machines
Complexity
Delay
Educational institutions
Genetic algorithms
genetic algortihm
Genetic engineering
Industrial engineering
Job shop scheduling
Makespan
Manufacturing
Minimization methods
No-wait flowshop problem
Switches
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/ICCET.2009.215