Single machine scheduling with step-deteriorating processing times

DOI10.1016/S0377-2217(00)00284-8MaRDI QIDQ5952512zbMATH OpenOpenAlexFDO

Authors T. C. Edwin Cheng, Q. Ding

Publication date 14 May 2002

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

Full work available at URL https://doi.org/10.1016/s0377-2217(00)00284-8

zbMATH Keywords

computational complexityflow time problemmakespanschedulingsequencingstep-deterioration

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Makespan minimization in single-machine scheduling with step-deterioration of processing times
• Scheduling with step-deteriorating jobs to minimize the makespan
• Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
• Single-machine scheduling with deteriorating jobs
• Scheduling deteriorating jobs to minimize makespan

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling deteriorating jobs to minimize makespan
• Single machine scheduling with start time dependent processing times: Some solvable cases
• The complexity of scheduling starting time dependent tasks with release times
• The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
• The time dependent machine makespan problem is strongly NP-complete

Cited in

(43)

• Single machine parallel-batch scheduling with deteriorating jobs
• Scheduling jobs under decreasing linear deterioration
• A concise survey of scheduling with time-dependent processing times
• Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration
• Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
• 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
• Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events
• An improved discrete artificial bee colony algorithm for flexible flowshop scheduling with step deteriorating jobs and sequence-dependent setup times
• Scheduling with step-deteriorating jobs to minimize the makespan
• 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
• Scheduling with step-improving processing times
• A single-machine deteriorating job scheduling problem with a non-regular criterion
• Scheduling deteriorating jobs on a single machine with release times and rejection
• Modeling the parallel machine scheduling problem with step deteriorating jobs
• scientific article; zbMATH DE number 5732213 (Why is no real title available?)
• Approximation algorithms for parallel machine scheduling with linear deterioration
• An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
• Makespan minimization in single-machine scheduling with step-deterioration of processing times
• Single-machine scheduling with deteriorating jobs
• scientific article; zbMATH DE number 6177807 (Why is no real title available?)
• A single-machine scheduling with a truncated linear deterioration and ready times
• Two-agent scheduling with position-based deteriorating jobs and learning effects
• Parallel-Machine Scheduling with Step-Deteriorating Jobs to Minimize the Total (Weighted) Completion Time
• 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
• Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times
• Some single-machine and flowshop scheduling problems with a non-linear deterioration function
• Theory and methodology of time-dependent scheduling: past, present and future
• Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
• Minimizing the number of late jobs and total late work with step-learning
• Single-machine scheduling with step-deteriorating jobs and rejection
• 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
• A simple linear time algorithm for scheduling with step-improving processing times
• Scheduling linear deteriorating jobs with rejection on a single machine

This page was built for publication: Single machine scheduling with step-deteriorating processing times

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