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 QIDQ2147013FDOQ2147013
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
Recommendations
- A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance
- Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
- Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
Cites Work
- Optimal two- and three-stage production schedules with set-up time included
- Variable neighborhood search
- Variable neighborhood search and local branching
- Minimizing Total Tardiness on One Machine is NP-Hard
- A tabu search algorithm for parallel machine total tardiness problem
- 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
- Machine scheduling with a rate-modifying activity
- A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity
- A decomposition algorithm for the single machine total tardiness problem
- Integrated production scheduling and maintenance policy for robustness in a single machine
- Title not available (Why is that?)
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
- New Precedence Theorems for One-Machine Weighted Tardiness
- Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
- Total tardiness minimization in permutation flowshop with deterioration consideration
- Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times
- Unrelated parallel-machine scheduling problems with multiple rate-modifying activities
- A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
- Integration of scheduling and advanced process control in semiconductor manufacturing: review and outlook
- Minimizing total load on parallel machines with linear deterioration
Cited In (3)
- A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness
- Nested general variable neighborhood search for the periodic maintenance problem
- Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147013)
