New algorithms for coupled tasks scheduling – a survey

DOI10.1051/ro/2012020zbMath1262.90060OpenAlexW2116751537WikidataQ57387724 ScholiaQ57387724MaRDI QIDQ4917224

Grzegorz Pawlak, Jacek Błażewicz, Michał Tanaś, Wojciech Wojciechowicz

Publication date: 29 April 2013

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7a1f804c87606bbab1a59c2749d280c92fc7d504

zbMATH Keywords

schedulingheuristic algorithmscomplexity theorycoupled tasks

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27)

Related Items (5)

Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers ⋮ Coupled task scheduling with exact delays: literature review and models ⋮ Parameterized complexity of a coupled-task scheduling problem ⋮ Scheduling coupled tasks with exact delays for minimum total job completion time ⋮ Two-machine flowshop scheduling problem with coupled-operations

This page was built for publication: New algorithms for coupled tasks scheduling – a survey