Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences

DOI10.1016/j.dam.2005.04.016zbMath1113.90059OpenAlexW2118506190MaRDI QIDQ2433803

Lidia Pankowska, Stanisław Gawiejnowicz, Wiesław Kurc

Publication date: 30 October 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.04.016

zbMATH Keywords

deteriorating jobssingle machine schedulingtotal completion timeapproximate algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs ⋮ Minimizing total load on parallel machines with linear deterioration ⋮ New results for an open time-dependent scheduling problem ⋮ Scheduling time-dependent jobs under mixed deterioration ⋮ Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times ⋮ Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Conjugate problems in time-dependent scheduling ⋮ Equivalent time-dependent scheduling problems

Cites Work

• Scheduling jobs with varying processing times
• Scheduling jobs under simple linear deterioration
• A concise survey of scheduling with time-dependent processing times
• Single machine scheduling with deadlines and increasing rates of processing times
• Parallel machine scheduling with time dependent processing times
• Scheduling with time dependent processing times: Review and extensions
• V-Shaped Policies for Scheduling Deteriorating Jobs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item