Scheduling with deterioration effects and maintenance activities under parallel processors
From MaRDI portal
Publication:6048066
DOI10.1080/0305215x.2020.1844194zbMath1523.90160OpenAlexW3107559031MaRDI QIDQ6048066
Weiwei Liu, Hongyu He, Yang Hu
Publication date: 10 October 2023
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2020.1844194
Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items
Cites Work
- Scheduling a deteriorating maintenance activity and due-window assignment
- Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
- Time-dependent scheduling
- Scheduling a maintenance activity to minimize total weighted completion-time
- A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration
- Scheduling on parallel processors with varying processing times
- A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
- A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity
- The effect of machine availability on the worst-case performance of LPT
- Minimizing total load on parallel machines with linear deterioration
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Single-machine scheduling problems with precedence constraints and simple linear deterioration
- Single-machine common flow allowance scheduling with job-dependent aging effects and a deteriorating maintenance activity
- Machine scheduling with an availability constraint
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling a deteriorating maintenance activity on a single machine
- `` Strong NP-Completeness Results
- Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
- Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology
- Performance of critical path type algorithms for scheduling on parallel processors
- Common due-window assignment for single-machine scheduling with generalized earliness/tardiness penalties and a rate-modifying activity