The scheduling problem in a container terminal is characterized by the coordination of
different types of equipment. In this paper, we present an integrated model to schedule the …

This paper addresses the deadlock (DL)-free scheduling problem of flexible manufacturing
systems (FMS) characterized by resource sharing, limited buffer capacity, routing flexibility …

In this paper we consider a job shop scheduling problem with blocking (BJSS) constraints.
Blocking constraints model the absence of buffers (zero buffer), whereas in the traditional …

Train scheduling is a complex and time consuming task of vital importance in many
countries. To create completely new train schedules that are more accurate and efficient …

In this paper, a new scheduling problem is investigated in order to optimise a more
generalised J ob S hop S cheduling system with a C ombination of four B uffering constraints …

This paper deals with the no-wait job shop scheduling problem resolution. The problem is to
find a schedule to minimize the makespan (C_ max C max), that is, the total completeness …

Abstract The Blocking Job Shop Scheduling (BJSS) is an NP-hard scheduling problem. It is
obtained from the classical job shop scheduling problem by replacing the infinite buffer …

This paper proposes an effective hybrid particle swarm optimization (HPSO) algorithm to
solve the deadlock-free scheduling problem of flexible manufacturing systems (FMSs) that …

Train scheduling is a complex and time consuming task of vital importance. To schedule
trains more accurately and efficiently than permitted by current techniques a novel hybrid job …

In this work, we introduce a Flexible Job-shop Scheduling Problem with Resource Recovery
Constraints (FRRC). In the FRRC, besides the constraints of the classical Flexible Job-shop …