Graphs are powerful tools to model manufacturing systems and scheduling problems. The
complexity of these systems and their scheduling problems has been substantially …

Sustainable manufacturing practices are crucial in job shop scheduling (JSS) to enhance
the resilience of production systems against resource shortages and regulatory changes …

The blocking job shop problem is a variant of the classical job shop problem, where a job
continues to block a machine after being serviced, until the downstream machine needed by …

The job shop scheduling literature has been dominated by a focus on regular objective
functions–in particular the makespan–in its half a century long history. The last twenty years …

The job shop scheduling problem with blocking constraints and total tardiness minimization
represents a challenging combinatorial optimization problem of high relevance in production …

In the manufacturing of highly customized goods and the operation of automatic logistics
systems, efficient schedules constitute an everyday challenge. Therefore, the job shop …

In this paper, we consider a job-shop scheduling problem with mixed blocking constraints.
Contrary to most previous studies, where no blocking or only one type of blocking constraint …

Petri nets are a promising tool for development of distributed scheduling approaches and
integrating these developments with state-of-the-art schedule optimization algorithms. A …

Planning the course of events and activities constitutes an everyday challenge in many
companies. Complex decisions are to be made regarding the allocation of a diverse range …

This paper considers the problem of servicing a set of locations by a fleet of robots so as to
minimize overall makespan. Although motivated by a specific real-world, multi-robot drilling …