Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families

Motivated by a bottleneck operation in an MLCC (multi-layer ceramic capacitor) production line, we study the scheduling problem of parallel batch processing machines in which a number of jobs can be processed simultaneously in a machine as a batch. Volumes of the jobs are different from each other a...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research 2004-10, Vol.42 (19), p.4091-4107
Main Authors: Koh, Shie-Gheun, Koo, Pyung-Hoi, Ha, Jae-Won, Lee, Woon-Seek
Format: Article
Language:English
Subjects:
Batch processing
Genetic algorithms
Operations research
Parallel processing
Production scheduling
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Motivated by a bottleneck operation in an MLCC (multi-layer ceramic capacitor) production line, we study the scheduling problem of parallel batch processing machines in which a number of jobs can be processed simultaneously in a machine as a batch. Volumes of the jobs are different from each other and each job belongs to the family in which all jobs have the same processing time. In this situation, we analyse three kinds of problems whose performance measures are makespan, total completion time, and total weighted completion time, respectively. Since these problems are known to be NP-hard, we propose a number of heuristics and design genetic algorithms for the problems. Through some computational experiments, we evaluate the performances of the heuristic algorithms proposed, including the genetic algorithms for each of three problems.
ISSN:0020-7543
1366-588X
DOI:10.1080/00207540410001704041