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 …

Reinforcement learning (RL) offers promising opportunities to handle the ever-increasing
complexity in managing modern production systems. We apply a Q-learning algorithm in …

We present a new set of simulation models, organized in a testbed. The aim of the testbed
consists in providing researchers with a platform able to credibly represent the complexity of …

A flexible job-shop scheduling problem (FJSP) with parallel batch processing machines
(PBM) is addressed. First, we exhibit an enhanced mixed integer programming (MIP) model …

Continuous product individualization and customization led to the advent of lot size one in
production and ultimately to product-inherent uniqueness. As complexities in …

Abstract We consider a Flexible Job-Shop scheduling problem with batching machines,
reentrant flows, sequence dependent setup times and release dates while considering …

This paper studies the scheduling of jobs of different families on parallel machines, where
not all machines are qualified (eligible) to process all job families. Originating from …

Abstract Flexible Job-Shop Scheduling Problem (FJSP) with Parallel Batch processing
Machine (PBM) is studied. First, a Mixed Integer Programming (MIP) formulation is proposed …

In this paper, we discuss a flexible flow shop scheduling problem with batch processing
machines at each stage and with jobs that have unequal ready times. Scheduling problems …

In this paper, we discuss scheduling problems for parallel batch processing machines,
incompatible job families, and an arbitrary regular sum objective. Only jobs of the same …