Single machine scheduling with deadlines and increasing rates of processing times
From MaRDI portal
Publication:1567197
DOI10.1007/s002360050170zbMath0958.68018OpenAlexW2094715971MaRDI QIDQ1567197
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
Related Items (16)
A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration ⋮ The complexity of scheduling starting time dependent tasks with release times ⋮ Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs ⋮ A concise survey of scheduling with time-dependent processing times ⋮ Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences ⋮ Single-machine scheduling with deteriorating jobs ⋮ Scheduling of deteriorating jobs with release dates to minimize the maximum lateness ⋮ Rescheduling problems with deteriorating jobs under disruptions ⋮ Single machine scheduling problems with deteriorating jobs ⋮ Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration ⋮ Isomorphic scheduling problems ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Equivalent time-dependent scheduling problems ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ A note on the complexity of scheduling problems with linear job deterioration ⋮ Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
This page was built for publication: Single machine scheduling with deadlines and increasing rates of processing times
