Single machine scheduling with step-deteriorating processing times

DOI10.1016/S0377-2217(00)00284-8zbMath0984.90014MaRDI QIDQ5952512

Cheng, T. C. Edwin, Qing Ding

Publication date: 14 May 2002

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

zbMATH Keywords

computational complexity; scheduling; makespan; sequencing; flow time problem; step-deterioration

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90B35: Deterministic scheduling theory in operations research

Related Items

Single-machine scheduling with deteriorating jobs, Modeling the parallel machine scheduling problem with step deteriorating jobs, Approximation algorithms for parallel machine scheduling with linear deterioration, An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration, A single-machine scheduling with a truncated linear deterioration and ready times, Two-agent scheduling with position-based deteriorating jobs and learning effects, Single-machine scheduling with deteriorating functions for job processing times, Scheduling problems with general effects of deterioration and learning, Single-machine scheduling with a nonlinear deterioration function, Some single-machine and flowshop scheduling problems with a non-linear deterioration function, Scheduling of deteriorating jobs with release dates to minimize the maximum lateness, A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration, Batch scheduling of step deteriorating jobs, A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine, Flow shop scheduling problems with decreasing linear deterioration under dominant machines, Scheduling linear deteriorating jobs with rejection on a single machine, Single machine parallel-batch scheduling with deteriorating jobs, Scheduling jobs under decreasing linear deterioration, A concise survey of scheduling with time-dependent processing times, Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs, Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs, Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs, A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs, Single-machine group scheduling problems with deterioration consideration, A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times, Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates, A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION, SCHEDULING DETERIORATING JOBS ON A SINGLE MACHINE WITH RELEASE TIMES AND REJECTION

Cites Work

• The complexity of scheduling starting time dependent tasks with release times
• The time dependent machine makespan problem is strongly NP-complete
• Single machine scheduling with start time dependent processing times: Some solvable cases
• The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Unnamed Item
• Unnamed Item