Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times

Lars Mönch, Hari Balasubramanian, John Fowler, Michele E. Pfund

Research output: Contribution to journalArticle

149 Citations (Scopus)

Abstract

This research is motivated by a scheduling problem found in the diffusion and oxidation areas of semiconductor wafer fabrication, where the machines can be modeled as parallel batch processors. We attempt to minimize total weighted tardiness on parallel batch machines with incompatible job families and unequal ready times of the jobs. Given that the problem is NP-hard, we propose two different decomposition approaches. The first approach forms fixed batches, then assigns these batches to the machines using a genetic algorithm (GA), and finally sequences the batches on individual machines. The second approach first assigns jobs to machines using a GA, then forms batches on each machine for the jobs assigned to it, and finally sequences these batches. Dispatching and scheduling rules are used for the batching phase and the sequencing phase of the two approaches. In addition, as part of the second decomposition approach, we develop variations of a time window heuristic based on a decision theory approach for forming and sequencing the batches on a single machine.

Original languageEnglish (US)
Pages (from-to)2731-2750
Number of pages20
JournalComputers and Operations Research
Volume32
Issue number11
DOIs
StatePublished - Nov 2005

Fingerprint

Unequal
Batch
scheduling
heuristics
Genetic algorithms
Scheduling
Heuristics
Decomposition
Decision theory
Computational complexity
Semiconductor materials
Fabrication
Oxidation
Sequencing
Assign
Genetic Algorithm
decision theory
Batching
Decompose
Dispatching

Keywords

  • Batching
  • Genetic algorithms
  • Parallel machines
  • Scheduling
  • Semiconductor manufacturing

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Applied Mathematics
  • Modeling and Simulation
  • Transportation

Cite this

Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. / Mönch, Lars; Balasubramanian, Hari; Fowler, John; Pfund, Michele E.

In: Computers and Operations Research, Vol. 32, No. 11, 11.2005, p. 2731-2750.

Research output: Contribution to journalArticle

@article{699aa2e59bb14a0587061535a6bdbd01,
title = "Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times",
abstract = "This research is motivated by a scheduling problem found in the diffusion and oxidation areas of semiconductor wafer fabrication, where the machines can be modeled as parallel batch processors. We attempt to minimize total weighted tardiness on parallel batch machines with incompatible job families and unequal ready times of the jobs. Given that the problem is NP-hard, we propose two different decomposition approaches. The first approach forms fixed batches, then assigns these batches to the machines using a genetic algorithm (GA), and finally sequences the batches on individual machines. The second approach first assigns jobs to machines using a GA, then forms batches on each machine for the jobs assigned to it, and finally sequences these batches. Dispatching and scheduling rules are used for the batching phase and the sequencing phase of the two approaches. In addition, as part of the second decomposition approach, we develop variations of a time window heuristic based on a decision theory approach for forming and sequencing the batches on a single machine.",
keywords = "Batching, Genetic algorithms, Parallel machines, Scheduling, Semiconductor manufacturing",
author = "Lars M{\"o}nch and Hari Balasubramanian and John Fowler and Pfund, {Michele E.}",
year = "2005",
month = "11",
doi = "10.1016/j.cor.2004.04.001",
language = "English (US)",
volume = "32",
pages = "2731--2750",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "11",

}

TY - JOUR

T1 - Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times

AU - Mönch, Lars

AU - Balasubramanian, Hari

AU - Fowler, John

AU - Pfund, Michele E.

PY - 2005/11

Y1 - 2005/11

N2 - This research is motivated by a scheduling problem found in the diffusion and oxidation areas of semiconductor wafer fabrication, where the machines can be modeled as parallel batch processors. We attempt to minimize total weighted tardiness on parallel batch machines with incompatible job families and unequal ready times of the jobs. Given that the problem is NP-hard, we propose two different decomposition approaches. The first approach forms fixed batches, then assigns these batches to the machines using a genetic algorithm (GA), and finally sequences the batches on individual machines. The second approach first assigns jobs to machines using a GA, then forms batches on each machine for the jobs assigned to it, and finally sequences these batches. Dispatching and scheduling rules are used for the batching phase and the sequencing phase of the two approaches. In addition, as part of the second decomposition approach, we develop variations of a time window heuristic based on a decision theory approach for forming and sequencing the batches on a single machine.

AB - This research is motivated by a scheduling problem found in the diffusion and oxidation areas of semiconductor wafer fabrication, where the machines can be modeled as parallel batch processors. We attempt to minimize total weighted tardiness on parallel batch machines with incompatible job families and unequal ready times of the jobs. Given that the problem is NP-hard, we propose two different decomposition approaches. The first approach forms fixed batches, then assigns these batches to the machines using a genetic algorithm (GA), and finally sequences the batches on individual machines. The second approach first assigns jobs to machines using a GA, then forms batches on each machine for the jobs assigned to it, and finally sequences these batches. Dispatching and scheduling rules are used for the batching phase and the sequencing phase of the two approaches. In addition, as part of the second decomposition approach, we develop variations of a time window heuristic based on a decision theory approach for forming and sequencing the batches on a single machine.

KW - Batching

KW - Genetic algorithms

KW - Parallel machines

KW - Scheduling

KW - Semiconductor manufacturing

UR - http://www.scopus.com/inward/record.url?scp=13844256873&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=13844256873&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2004.04.001

DO - 10.1016/j.cor.2004.04.001

M3 - Article

AN - SCOPUS:13844256873

VL - 32

SP - 2731

EP - 2750

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 11

ER -