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 flow-shop scheduling problem with exact delays is generalization of no-wait flow-shop
scheduling in which an exact delay exists between the consecutive tasks of each job. The …

The development of artificial intelligence systems with advanced reasoning capabilities
represents a persistent and long-standing research question. Traditionally, the primary …

Scheduling coupled tasks with exact delays for minimum total job completion time | Journal of
Scheduling Skip to main content SpringerLink Account Menu Find a journal Publish with us …

The coupled task scheduling problem aims to schedule 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 …

This study addresses a scheduling problem involving a single-machine with coupled-tasks
and bi-objective optimisation considering simultaneously inventory and environmental …

Coupled tasks are two-operation tasks, where the two operations are separated by a time
interval of fixed duration. Coupled task scheduling problems refer then to the scheduling of a …

The general single machine coupled task scheduling problem with the objective function of
minimizing the makespan, which is strongly NP‐hard, aims to schedule a set of coupled task …

The single machine coupled task scheduling problem includes a set of jobs, each with two
separated tasks, and there is an exact delay between the tasks. We investigate the single …

Coupled task problems arise in connection with radar systems. For the transmission and
reception of an electromagnetic pulse the radar (the processor) has to execute two tasks that …