Single machine scheduling with step-deteriorating processing times
From MaRDI portal
Publication:5952512
DOI10.1016/S0377-2217(00)00284-8zbMath0984.90014OpenAlexW1967121062MaRDI QIDQ5952512
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
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
SCHEDULING DETERIORATING JOBS ON A SINGLE MACHINE WITH RELEASE TIMES 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 ⋮ Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs ⋮ Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration ⋮ Modeling the parallel machine scheduling problem with step deteriorating jobs ⋮ Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities ⋮ Flow shop scheduling problems with decreasing linear deterioration under dominant machines ⋮ Single-machine scheduling with deteriorating functions for job processing times ⋮ Approximation algorithms for parallel machine scheduling with linear deterioration ⋮ Parallel-Machine Scheduling with Step-Deteriorating Jobs to Minimize the Total (Weighted) Completion Time ⋮ Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs ⋮ Scheduling problems with general effects of deterioration and learning ⋮ A concise survey of scheduling with time-dependent processing times ⋮ An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration ⋮ A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs ⋮ Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs ⋮ Single-machine scheduling with a nonlinear deterioration function ⋮ Some single-machine and flowshop scheduling problems with a non-linear deterioration function ⋮ Single-machine group scheduling problems with deterioration consideration ⋮ A single-machine scheduling with a truncated linear deterioration and ready times ⋮ Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events ⋮ A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION ⋮ Single-machine scheduling with deteriorating jobs ⋮ A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times ⋮ Scheduling linear deteriorating jobs with rejection on a single machine ⋮ Scheduling of deteriorating jobs with release dates to minimize the maximum lateness ⋮ Two-agent scheduling with position-based deteriorating jobs and learning effects ⋮ Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates ⋮ Single machine parallel-batch scheduling with deteriorating jobs ⋮ An improved discrete artificial bee colony algorithm for flexible flowshop scheduling with step deteriorating jobs and sequence-dependent setup times ⋮ Scheduling jobs under decreasing linear deterioration
Cites Work
- Unnamed Item
- 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
- Scheduling deteriorating jobs to minimize makespan
