On the complexity of coupled-task scheduling

From MaRDI portal
Publication:5961610

DOI10.1016/S0166-218X(96)00041-8zbMath0873.90053OpenAlexW1966465131MaRDI QIDQ5961610

A. J. Orman, Chris N. Potts

Publication date: 25 February 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam




Related Items (27)

Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasksCoupled task scheduling with convex resource consumption functionsScheduling of coupled tasks with unit processing timesModelling for the control of a complex radar systemA binary search algorithm for the general coupled task scheduling problemSome complexity and approximation results for coupled-tasks scheduling problem according to topologyA branch-and-bound algorithm for the coupled task problemApproximation algorithms for coupled task scheduling minimizing the sum of completion timesThe coupled task scheduling problem: an improved mathematical program and a new solution algorithmIdentical coupled task scheduling: polynomial complexity of the cyclic caseIsomorphic coupled-task scheduling problem with compatibility constraints on a single processorApproximation algorithms for UET scheduling problems with exact delaysScheduling of coupled tasks and one-machine no-wait robotic cellsMinimizing flowtime for paired tasksA note on scheduling identical coupled tasks in logarithmic timeScheduling coupled-operation jobs with exact time-lagsCoupled task scheduling with exact delays: literature review and modelsParameterized complexity of a coupled-task scheduling problemTwo machines flow shop with reentrance and exact time lagImproved analysis of an algorithm for the coupled task problem with UET jobsScheduling for a multifunction phased array radar systemA first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delaysScheduling coupled tasks with exact delays for minimum total job completion timeCoupled task scheduling with time-dependent processing timesCable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraintsTwo-machine flowshop scheduling problem with coupled-operationsSCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS



Cites Work


This page was built for publication: On the complexity of coupled-task scheduling