Pages that link to "Item:Q1107434"
From MaRDI portal
The following pages link to On the two-phase method for preemptive scheduling (Q1107434):
Displaying 9 items.
- A two-stage hardware scheduler combining greedy and optimal scheduling (Q436901) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- Almost nonpreemptive schedules (Q922279) (← links)
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard (Q1266667) (← links)
- Mathematical models for preemptive shop scheduling problems (Q1762150) (← links)
- On preemptive scheduling: A general setting for the two-phase method (Q1917267) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages (Q2356251) (← links)
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)