Equivalent time-dependent scheduling problems

DOI10.1016/j.ejor.2008.04.040zbMath1176.90213OpenAlexW2084399987MaRDI QIDQ1041934

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

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.04.040

zbMATH Keywords

schedulingdeteriorating jobslinear deterioration

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (11)

An alternative approach for proving the NP-hardness of optimization problems ⋮ Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration ⋮ A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration ⋮ Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices ⋮ OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success ⋮ Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times ⋮ Scheduling time-dependent jobs under mixed deterioration ⋮ Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan ⋮ Isomorphic scheduling problems ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Conjugate problems in time-dependent scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of scheduling starting time dependent tasks with release times
• Complexity of scheduling tasks with time-dependent execution times
• 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
• Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
• Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
• Scheduling with time dependent processing times: Review and extensions
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Parallel Processing and Applied Mathematics
• A note on parallel-machine scheduling with deteriorating jobs
• Handbook on Scheduling
• Parallel Processing and Applied Mathematics

This page was built for publication: Equivalent time-dependent scheduling problems