Pages that link to "Item:Q724106"
From MaRDI portal
The following pages link to Two-machine flow shop and open shop scheduling problems with a single maintenance window (Q724106):
Displaying 10 items.
- Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling (Q1999390) (← links)
- Improved algorithms for proportionate flow shop scheduling with due-window assignment (Q2069253) (← links)
- Production, maintenance and resource scheduling: a review (Q2098022) (← links)
- A PTAS for non-resumable open shop scheduling with an availability constraint (Q2125217) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Open shop scheduling problem with a non-resumable flexible maintenance period (Q2150575) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209) (← links)
- Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity (Q6109346) (← links)
- Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions (Q6112735) (← links)
