Two-machine flow shop and open shop scheduling problems with a single maintenance window
From MaRDI portal
Publication:724106
DOI10.1016/j.ejor.2018.04.019zbMath1403.90352OpenAlexW2800473148WikidataQ129952511 ScholiaQ129952511MaRDI QIDQ724106
Assaf Sarig, Jonathan Mosheiff, Gur Mosheiov, Vitaly A. Strusevich
Publication date: 25 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.019
Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (10)
A PTAS for non-resumable open shop scheduling with an availability constraint ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Open shop scheduling problem with a non-resumable flexible maintenance period ⋮ A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions ⋮ Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity ⋮ Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling ⋮ Improved algorithms for proportionate flow shop scheduling with due-window assignment ⋮ Production, maintenance and resource scheduling: a review
Cites Work
- Unnamed Item
- Unnamed Item
- Single-machine scheduling with periodic maintenance to minimize makespan revisited
- Approximation results for flow shop scheduling problems with machine availability constraints
- A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Two-machine flowshop scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Non-preemptive two-machine open shop scheduling with non-availability constraints
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Machine scheduling with a rate-modifying activity
- A cyclical search for the two machine flow shop and open shop to minimise finishing time
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
- Two-machine flow shop no-wait scheduling with machine maintenance
- Optimal two- and three-stage production schedules with setup times included
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- Planning Machine Maintenance in Two-Machine Shop Scheduling
- Single-machine scheduling with flexible and periodic maintenance
- Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
- Scheduling a deteriorating maintenance activity on a single machine
- Open Shop Scheduling to Minimize Finish Time
- Approximation Algorithms for Three-Machine Open Shop Scheduling
- Two-machine open shop scheduling with an availability constraint
- Two-machine flow shops with limited machine availability
This page was built for publication: Two-machine flow shop and open shop scheduling problems with a single maintenance window
