Single machine scheduling with deadlines and increasing rates of processing times

DOI10.1007/s002360050170zbMath0958.68018MaRDI QIDQ1567197

Cheng, T. C. Edwin, Qing Ding

Publication date: 9 April 2001

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050170

zbMATH Keywords

scheduling; dynamic programming algorithm

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Single-machine scheduling with deteriorating jobs, The complexity of scheduling starting time dependent tasks with release times, Scheduling of deteriorating jobs with release dates to minimize the maximum lateness, Isomorphic scheduling problems, A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration, Rescheduling problems with deteriorating jobs under disruptions, Equivalent time-dependent scheduling problems, A concise survey of scheduling with time-dependent processing times, Single machine scheduling problems with deteriorating jobs, Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine, Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs, Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, A note on the complexity of scheduling problems with linear job deterioration, Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences