Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
From MaRDI portal
Publication:1869884
DOI10.1016/S0305-0548(01)00077-6zbMath1029.90028OpenAlexW2085353832MaRDI QIDQ1869884
Publication date: 28 April 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00077-6
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
The complexity of scheduling starting time dependent tasks with release times ⋮ A periodic collaboration and coexistence management model with the oscillation effect for complex mega infrastructure project under the risk of infection ⋮ A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time ⋮ Minimizing total load on parallel machines with linear deterioration ⋮ Single-machine scheduling with deteriorating functions for job processing times ⋮ A concise survey of scheduling with time-dependent processing times ⋮ Some single-machine and flowshop scheduling problems with a non-linear deterioration function ⋮ Single-machine group scheduling problems with deterioration consideration ⋮ A single-machine scheduling with a truncated linear deterioration and ready times ⋮ A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION ⋮ Single-machine scheduling with deteriorating jobs ⋮ Connected searching of weighted trees ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling with time-dependent execution times
- The time dependent machine makespan problem is strongly NP-complete
- Complexity of scheduling tasks with time-dependent execution times
- Single machine scheduling with deadlines and increasing rates of processing times
- The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
- A note on single-processor scheduling with time-dependent execution times
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey