Coupled task scheduling with exact delays: literature review and models
From MaRDI portal
Publication:2282490
DOI10.1016/j.ejor.2019.08.045zbMath1430.90271OpenAlexW2972249483WikidataQ127299371 ScholiaQ127299371MaRDI QIDQ2282490
Mostafa Khatami, Amir Salehipour, Cheng, T. C. Edwin
Publication date: 8 January 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10453/136099
Related Items (9)
Coupled task scheduling with convex resource consumption functions ⋮ A binary search algorithm for the general coupled task scheduling problem ⋮ Approximation algorithms for coupled task scheduling minimizing the sum of completion times ⋮ The coupled task scheduling problem: an improved mathematical program and a new solution algorithm ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays ⋮ Scheduling coupled tasks with exact delays for minimum total job completion time ⋮ Coupled task scheduling with time-dependent processing times ⋮ Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag
Uses Software
Cites Work
- A branch-and-bound algorithm for the coupled task problem
- Polynomial-time approximation schemes for scheduling problems with time lags
- Scheduling of coupled tasks with unit processing times
- Scheduling coupled-operation jobs with exact time-lags
- Feasible insertions in job shop scheduling, short cycles and stable sets
- Identical coupled task scheduling: polynomial complexity of the cyclic case
- Scheduling of coupled tasks and one-machine no-wait robotic cells
- A note on scheduling identical coupled tasks in logarithmic time
- Minimizing total completion time in two-machine flow shops with exact delays
- Improved analysis of an algorithm for the coupled task problem with UET jobs
- Interleaving two-phased jobs on a single machine
- Scheduling for a multifunction phased array radar system
- Modelling for the control of a complex radar system
- A survey of scheduling problems with no-wait in process
- An exact algorithm for scheduling identical coupled tasks
- A decomposition algorithm for the single machine total tardiness problem
- Parameterized complexity of a coupled-task scheduling problem
- Two-machine flowshop scheduling problem with coupled-operations
- The no-wait job shop with regular objective: a method based on optimal job insertion
- Optimal job insertion in the no-wait job shop
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
- Approximation algorithms for UET scheduling problems with exact delays
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness
- Scheduling with Deadlines and Loss Functions
- Sequencing n Jobs on Two Machines with Arbitrary Time Lags
- Two machines flow shop with reentrance and exact time lag
- Optimal two- and three-stage production schedules with setup times included
- Some complexity and approximation results for coupled-tasks scheduling problem according to topology
- Permutation flow shops with exact time lags to minimise maximum lateness
- Approximating Coupled-Task Scheduling Problems with Equal Exact Delays
- Some new results in flow shop scheduling
- SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
- Heuristics for a coupled-operation scheduling problem
- Complexity of Scheduling Shops with No Wait in Process
- Scheduling coupled tasks
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Shop Problems With Two Machines and Time Lags
- Radar pulse interleaving for multi‐target tracking
- New algorithms for coupled tasks scheduling – a survey
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Approximation Algorithms for Scheduling Problems with Exact Delays
- NP-hardness of compact scheduling in simplified open and flow shops.
- On the complexity of coupled-task scheduling
This page was built for publication: Coupled task scheduling with exact delays: literature review and models
