The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
From MaRDI portal
Publication:422898
DOI10.1016/j.amc.2011.12.020zbMath1237.90096MaRDI QIDQ422898
Publication date: 18 May 2012
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.12.020
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research
Related Items
Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models, Strong NP-hardness of scheduling problems with learning or aging effect, The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect, A single-machine bi-criterion scheduling problem with two agents, Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time, The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times, Single-machine scheduling with workload-dependent maintenance duration to minimize maximum lateness, Task scheduling in distributed real-time systems, Single-machine scheduling with upper bounded maintenance time under the deteriorating effect, Two-agent single-machine scheduling with assignable due dates
Cites Work
- Unnamed Item
- The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Single-machine scheduling with deteriorating functions for job processing times
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities
- 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
- A note on scheduling deteriorating jobs
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
- Single-machine group scheduling problems with deteriorated and learning effect
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- A concise survey of scheduling with time-dependent processing times
- A correlation and heuristic approach for obtaining production sequences requiring a minimum of tool replacements
- Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
- Single-machine group scheduling with a time-dependent learning effect
- Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling jobs under an aging effect
- Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration
