The coupled task scheduling problem concerns scheduling a set of jobs, each with at least
two tasks and there is an exact delay period between two consecutive tasks, on a set of …

The no-wait job shop where no waiting time is allowed between two successive operations
of a job has a strong industrial background, especially in steel-making industry and concrete …

This study focused on the no-wait jobshop scheduling problem (NWJSP), which is NP-hard
in the strong sense. A new benchmarking algorithm, named backtracking multi-start …

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 no-wait job shop scheduling problem is a well-known NP-hard problem and it is
typically decomposed into timetabling subproblem and sequencing subproblem. By …

The no-wait job shop problem has important applications in various industries such as steel-
making and chemical processes, and its mainstream approaches are metaheuristics with …

The pipe-spool fabrication process is a critical operational section in the piping projects that
usually used to accelerate and discipline the installation process, especially, when we have …

This paper deals with the makespan-minimization job shop scheduling problem (JSSP) with
no-wait precedence constraints. The no-wait JSSP is an extension of the well-known JSSP …

The coupled task scheduling problem (CTSP) is studied in this thesis. The problem consists
of scheduling a set of jobs on one or a set of machines, where each job consists of at least …

In the field of Scheduling Optimization, the Job-Shop scheduling problem entails a high level
of complexity and is often solved with the aid of metaheuristic algorithms. In its Flexible …