A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance
From MaRDI portal
Publication:2147013
DOI10.1016/j.cor.2022.105738OpenAlexW4212934617MaRDI QIDQ2147013
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105738
Related Items (2)
Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity ⋮ A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness
Cites Work
- Unnamed Item
- Integrated production scheduling and maintenance policy for robustness in a single machine
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
- Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
- Variable neighborhood search
- Machine scheduling with a rate-modifying activity
- Total tardiness minimization in permutation flowshop with deterioration consideration
- Unrelated parallel machines scheduling with deteriorating jobs and resource dependent 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
- A tabu search algorithm for parallel machine total tardiness problem
- A decomposition algorithm for the single machine total tardiness problem
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
- Minimizing total load on parallel machines with linear deterioration
- Integration of scheduling and advanced process control in semiconductor manufacturing: review and outlook
- Unrelated parallel-machine scheduling problems with multiple rate-modifying activities
- Variable neighborhood search and local branching
- Optimal two- and three-stage production schedules with setup times included
- Minimizing Total Tardiness on One Machine is NP-Hard
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- New Precedence Theorems for One-Machine Weighted Tardiness
- Real-time health prognosis and dynamic preventive maintenance policy for equipment under aging Markovian deterioration
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
This page was built for publication: A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance
