Open shop scheduling problem with a non-resumable flexible maintenance period
From MaRDI portal
Publication:2150575
DOI10.1007/978-3-030-92681-6_40OpenAlexW4206113751MaRDI QIDQ2150575
Xin Han, Yuan Yuan, Yan Lan, Xin Bo Liu
Publication date: 29 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_40
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Two-machine flow shop and open shop scheduling problems with a single maintenance window
- Approximation results for flow shop scheduling problems with machine availability constraints
- A greedy open shop heuristic with job priorities
- Makespan minimization in open shops: A polynomial time approximation scheme
- Two-machine flowshop scheduling with availability constraints
- Non-preemptive two-machine open shop scheduling with non-availability constraints
- A PTAS for non-resumable open shop scheduling with an availability constraint
- Machine scheduling with an availability constraint
- Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
- Open Shop Scheduling to Minimize Finish Time
- Two-machine open shop scheduling with an availability constraint
This page was built for publication: Open shop scheduling problem with a non-resumable flexible maintenance period
