Single-machine scheduling with a nonlinear deterioration function
From MaRDI portal
Publication:656605
DOI10.1016/j.ipl.2010.04.012zbMath1229.90062OpenAlexW2082504605MaRDI QIDQ656605
Publication date: 18 January 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.04.012
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items (12)
Algorithms for single-machine scheduling problem with deterioration depending on a novel model ⋮ Parallel-machine scheduling with maintenance: praising the assignment problem ⋮ Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models ⋮ Parallel-machine scheduling problems with past-sequence-dependent delivery times and aging maintenance ⋮ Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration ⋮ The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect ⋮ Single-machine scheduling with upper bounded maintenance time under the deteriorating effect ⋮ A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models ⋮ Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times ⋮ Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time ⋮ Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates ⋮ The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard
Cites Work
- An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Time-dependent scheduling
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
- Single machine scheduling with start time dependent processing times: Some solvable cases
- A concise survey of scheduling with time-dependent processing times
- Single-machine group scheduling problems with deterioration consideration
- A state-of-the-art review on scheduling with learning effects
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling jobs with piecewise linear decreasing processing times
- Single machine scheduling with step-deteriorating processing times
This page was built for publication: Single-machine scheduling with a nonlinear deterioration function
