Single machine scheduling with deadlines and increasing rates of processing times

DOI10.1007/S002360050170MaRDI QIDQ1567197zbMATH OpenOpenAlexFDO

Authors T. C. Edwin Cheng, Q. 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, https://ink.library.smu.edu.sg/lkcsb_research/873

zbMATH Keywords

dynamic programming algorithmscheduling

Mathematics Subject Classification ID

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

Recommendations

• The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
• Scheduling problems with linear increasing processing times
• Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine

Cited in

(19)

• Equivalent time-dependent scheduling problems
• A concise survey of scheduling with time-dependent processing times
• The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of 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
• scientific article; zbMATH DE number 1594558 (Why is no real title available?)
• The complexity of scheduling starting time dependent tasks with release times
• Single-machine scheduling with deteriorating jobs
• Theory and methodology of time-dependent scheduling: past, present and future
• 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

This page was built for publication: Single machine scheduling with deadlines and increasing rates of processing times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567197)