Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
type: Item
instance of: scholarly article
title: Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
zbMATH Open document ID: 1029.90028
DOI: 10.1016/S0305-0548(01)00077-6
published in: Computers \& Operations Research
publication date: 2003-04-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1902960
zbMATH Keywords: Sequencing
zbMATH Keywords: time dependence scheduling
zbMATH Keywords: computational complexity
author: T. C. Edwin Cheng
author: Q. Ding
MaRDI profile type: Publication
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Scheduling Deteriorating Jobs on a Single Processor
cites work: Single machine scheduling with deadlines and increasing rates of processing times
cites work: Q4233364
cites work: Complexity of scheduling tasks with time-dependent execution times
cites work: The time dependent machine makespan problem is strongly NP-complete
cites work: The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
cites work: Scheduling with time-dependent execution times
cites work: A note on single-processor scheduling with time-dependent execution times
cites work: Scheduling with time dependent processing times: Review and extensions
cites work: Q4323632
cites work: Q4198056
full work available at URL: s0305-0548(01)00077-6
OpenAlex ID: W2085353832
description: scientific article; zbMATH DE number 1902960