Equivalent time-dependent scheduling problems

DOI10.1016/J.EJOR.2008.04.040MaRDI QIDQ1041934zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Isomorphic scheduling problems
• New results for an open time-dependent scheduling problem
• Conjugate problems in time-dependent scheduling
• Parallel-machine scheduling with time dependent processing times
• A concise survey of scheduling with time-dependent processing times

Cites work

• scientific article; zbMATH DE number 1264428 (Why is no real title available?)
• scientific article; zbMATH DE number 2086777 (Why is no real title available?)
• A concise survey of scheduling with time-dependent processing times
• A note on parallel-machine scheduling with deteriorating jobs
• Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
• Complexity of scheduling tasks with time-dependent execution times
• Handbook on Scheduling
• Parallel Processing and Applied Mathematics
• Parallel Processing and Applied Mathematics
• Parallel machine scheduling with time dependent processing times
• Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
• Scheduling with time dependent processing times: Review and extensions
• Single machine scheduling with deadlines and increasing rates of processing times
• The complexity of scheduling starting time dependent tasks with release times
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Cited in

(15)

• Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times
• Isomorphic scheduling problems
• Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
• Time-of-use scheduling problem with equal-length jobs
• Some remarks about the `equivalence' of performance measures in scheduling problems
• Scheduling time-dependent jobs under mixed deterioration
• A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
• An alternative approach for proving the NP-hardness of optimization problems
• Conjugate problems in time-dependent scheduling
• Variants of Multi-resource Scheduling Problems with Equal Processing Times
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Formulating a scheduling problem with almost identical jobs by using positional completion times
• Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration
• OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success

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

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