The flexible job shop scheduling problem (FJSP) is an NP-hard combinatorial optimization
problem, which has wide applications in the real world. The complexity and relevance of the …

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 …

In this paper, we discuss scheduling problems in semiconductor manufacturing. Starting
from describing the manufacturing process, we identify typical scheduling problems found in …

Over the last fifty-plus years, the increased complexity and speed of integrated circuits have
radically changed our world. Today, semiconductor manufacturing is perhaps the most …

In media, politics and science, Industrie 4.0, also called the fourth industrial revolution, has
become the synonym for increasing productivity in the 21st century by applying digital …

This paper focuses on the multi-objective resolution of a reentrant hybrid flow shop
scheduling problem (RHFS). In our case the two objectives are: the maximization of the …

The job shop scheduling problem (JSSP) has attracted much attention in the field of both
information sciences and operations research. In terms of the objective function, most …

In this paper, we discuss scheduling problems for flexible job shops that contain identical
and unrelated parallel machines. The performance measure is the total weighted tardiness …

In this paper, we discuss a scheduling problem for jobs on identical parallel machines.
Ready times of the jobs, precedence constraints, and sequence-dependent setup times are …

In modern manufacturing systems, due date related performance is becoming increasingly
important in maintaining a high service reputation. However, compared with the extensive …