[HTML][HTML] A survey of scheduling with parallel batch (p-batch) processing

JW Fowler, L Mönch - European journal of operational research, 2022 - Elsevier
Multiple jobs are processed simultaneously on a given batch processing machine in parallel
batching. The resulting batch is called a p-batch. Batching can lead to reduced production …

A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations

L Mönch, JW Fowler, S Dauzère-Pérès, SJ Mason… - Journal of …, 2011 - Springer
In this paper, we discuss scheduling problems in semiconductor manufacturing. Starting
from describing the manufacturing process, we identify typical scheduling problems found in …

A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival

TC Chiang, HC Cheng, LC Fu - Computers & Operations Research, 2010 - Elsevier
This paper addresses a scheduling problem motivated by scheduling of diffusion operations
in the wafer fabrication facility. In the target problem, jobs arrive at the batch machines at …

A state-of-art review and a simple meta-analysis on deterministic scheduling of diffusion furnaces in semiconductor manufacturing

M Vimala Rani, M Mathirajan - International Journal of Production …, 2023 - Taylor & Francis
This paper provides a systematic review of research works on deterministic scheduling of
diffusion furnaces (D-SDF) in the semiconductor manufacturing industry. After our screening …

Iterated local search for single machine total weighted tardiness batch scheduling

E Queiroga, RGS Pinheiro, Q Christ, A Subramanian… - Journal of …, 2021 - Springer
This paper presents an iterated local search (ILS) algorithm for the single machine total
weighted tardiness batch scheduling problem. To our knowledge, this is one of the first …

Scheduling parallel serial-batch processing machines with incompatible job families, sequence-dependent setup times and arbitrary sizes

C Gahm, S Wahl, A Tuma - International Journal of Production …, 2022 - Taylor & Francis
The scheduling of (parallel) serial-batch processing machines is a task arising in many
industrial sectors. In the metal-processing industry for instance, cutting operations are …

Batch scheduling on parallel machines with dynamic job arrivals and incompatible job families

E Cakici, SJ Mason, JW Fowler… - International Journal of …, 2013 - Taylor & Francis
We study the scheduling problem of minimising weighted completion times on parallel
identical batching machines with dynamic job arrivals and incompatible job families. Each …

Exact approaches for single machine total weighted tardiness batch scheduling

AA Pessoa, T Bulhões, V Nesello… - INFORMS Journal …, 2022 - pubsonline.informs.org
This paper addresses a single machine total weighted tardiness (TWT) batch-scheduling
problem in which jobs have release dates, nonidentical sizes, and are compatible between …

Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities

Z Jia, X Li, JYT Leung - Future Generation Computer Systems, 2017 - Elsevier
We consider the problem of scheduling a set of arbitrary size jobs with dynamic arrival times
on a set of parallel batch machines with arbitrary capacities; our goal is to minimize the …

A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals

S Yao, Z Jiang, N Li - Computers & operations research, 2012 - Elsevier
In this paper, we consider a single batch machine scheduling problem with incompatible job
families and dynamic job arrivals. The objective is to minimize the total completion time. This …