[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 …

Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time

H Zhang, K Li, C Chu, Z Jia - Computers & Operations Research, 2022 - Elsevier
This paper considers the integrated scheduling problem of production and delivery on
parallel batch processing machines with non-identical capacities in different locations in …

Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times

JEC Arroyo, JYT Leung - Computers & Operations Research, 2017 - Elsevier
This research analyzes the problem of scheduling a set of n jobs with arbitrary job sizes and
non-zero ready times on a set of m unrelated parallel batch processing machines so as to …

Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines

X Xin, MI Khan, S Li - Open Mathematics, 2023 - degruyter.com
We consider the problem of scheduling jobs with equal lengths and arbitrary sizes on
uniform parallel batch machines with different capacities. Each machine can only process …

An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times

JEC Arroyo, JYT Leung - Computers & Industrial Engineering, 2017 - Elsevier
This study addresses the problem of scheduling a set of n jobs with arbitrary job sizes and
non-zero ready times on a set of m unrelated parallel batch machines with different …

A hybrid discrete differential evolution–genetic algorithm approach with a new batch formation mechanism for parallel batch scheduling considering batch delivery

I Kucukkoc, G Aydin Keskin, AD Karaoglan… - … Journal of Production …, 2024 - Taylor & Francis
Scheduling is an important decision-making problem in production planning and the
resulting decisions have a direct impact on reducing waste, including energy and idle …

Improved MILP formulation equipped with valid inequalities for scheduling a batch processing machine with non-identical job sizes

AH Kashan, O Ozturk - Omega, 2022 - Elsevier
We consider the problem of minimizing makespan on a single batch processing machine
with a limited capacity. The machine can simultaneously process a group (batch) of jobs …

Two-stage hybrid flow shop scheduling on parallel batching machines considering a job-dependent deteriorating effect and non-identical job sizes

S Liu, J Pei, H Cheng, X Liu, PM Pardalos - Applied soft computing, 2019 - Elsevier
In this paper, we investigate a specialized two-stage hybrid flow shop scheduling problem
with parallel batching machines considering a job-dependent deteriorating effect and non …

Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization

H Zhang, K Li, Z Jia, C Chu - European Journal of Operational Research, 2023 - Elsevier
This paper considers the problem of scheduling a group of jobs with arbitrary release times,
non-identical sizes, and different processing times on non-identical parallel batch …

An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times

JEC Arroyo, JYT Leung, RG Tavares - Engineering Applications of Artificial …, 2019 - Elsevier
This paper investigates the problem of scheduling a set of jobs with arbitrary sizes and non-
zero release times on a set of unrelated parallel batch machines with different capacities so …