Coupled task scheduling with time-dependent processing times

DOI10.1007/s10951-020-00675-2zbMath1479.90096OpenAlexW3121761392MaRDI QIDQ2061140

Amir Salehipour, Mostafa Khatami

Publication date: 13 December 2021

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10453/145892

zbMATH Keywords

heuristicdynamic programcoupled task schedulinghealthcare schedulingsimple linear processing timetime-dependent processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

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

Cites Work

• A branch-and-bound algorithm for the coupled task problem
• Scheduling of coupled tasks with unit processing times
• Scheduling coupled-operation jobs with exact time-lags
• Identical coupled task scheduling: polynomial complexity of the cyclic case
• Time-dependent scheduling
• A note on scheduling identical coupled tasks in logarithmic time
• Interleaving two-phased jobs on a single machine
• Scheduling jobs under simple linear deterioration
• A concise survey of scheduling with time-dependent processing times
• Patient scheduling in hemodialysis service
• An exact algorithm for scheduling identical coupled tasks
• Coupled task scheduling with exact delays: literature review and models
• Parameterized complexity of a coupled-task scheduling problem
• 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
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
• Scheduling coupled tasks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On the complexity of coupled-task scheduling

This page was built for publication: Coupled task scheduling with time-dependent processing times