Scheduling coupled-operation jobs with exact time-lags

DOI10.1016/j.dam.2012.05.026zbMath1248.68109OpenAlexW2059662700MaRDI QIDQ714025

Alessandro Condotta, Natalia V. Shakhlevich

Publication date: 19 October 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.05.026

zbMATH Keywords

tabu searchNP-hardnesscoupled-operation schedulingexact time-lags

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

The no-wait job shop with regular objective: a method based on optimal job insertion, 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, Scheduling coupled-operation jobs with exact time-lags, Coupled task scheduling with exact delays: literature review and models, Scheduling coupled tasks with exact delays for minimum total job completion time, Coupled task scheduling with time-dependent processing times, Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints, Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A new neighborhood and tabu search for the blocking job shop
• A note on scheduling identical coupled tasks in logarithmic time
• One-machine generalized precedence constrained scheduling problems
• Scheduling chains on a single machine with non-negative time lags
• An exact algorithm for scheduling identical coupled tasks
• Approximation algorithms for UET scheduling problems with exact delays
• Feasible job insertions in the multi-processor-task job shop
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Scheduling chains with identical jobs and constant delays on a single machine
• On scheduling a multifunction radar
• Heuristics for a coupled-operation scheduling problem
• Scheduling coupled tasks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Radar pulse interleaving for multi‐target tracking
• Approximation Algorithms for Scheduling Problems with Exact Delays
• Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
• On the complexity of coupled-task scheduling