Coupled task scheduling with time-dependent processing times
type: Item
instance of: scholarly article
title: Coupled task scheduling with time-dependent processing times
zbMATH Open document ID: 1479.90096
author: Mostafa Khatami
author: Amir Salehipour
published in: Journal of Scheduling
publication date: 2021-12-13T00:00:00Z
full work available at URL: http://hdl.handle.net/10453/145892
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7443461
zbMATH Keywords: coupled task scheduling
zbMATH Keywords: time-dependent processing time
zbMATH Keywords: simple linear processing time
zbMATH Keywords: dynamic program
zbMATH Keywords: heuristic
zbMATH Keywords: healthcare scheduling
MaRDI profile type: Publication
OpenAlex ID: W3121761392
cites work: Approximation algorithms for UET scheduling problems with exact delays
cites work: An exact algorithm for scheduling identical coupled tasks
cites work: A note on scheduling identical coupled tasks in logarithmic time
cites work: A branch-and-bound algorithm for the coupled task problem
cites work: Parameterized complexity of a coupled-task scheduling problem
cites work: Scheduling of coupled tasks with unit processing times
cites work: A concise survey of scheduling with time-dependent processing times
cites work: Scheduling coupled-operation jobs with exact time-lags
cites work: Time-dependent scheduling
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Coupled task scheduling with exact delays: literature review and models
cites work: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
cites work: Identical coupled task scheduling: polynomial complexity of the cyclic case
cites work: SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
cites work: Patient scheduling in hemodialysis service
cites work: Scheduling jobs under simple linear deterioration
cites work: On the complexity of coupled-task scheduling
cites work: Scheduling coupled tasks
cites work: Interleaving two-phased jobs on a single machine
cites work: Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
cites work: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
DOI: 10.1007/S10951-020-00675-2
description: scientific article; zbMATH DE number 7443461