Pages that link to "Item:Q2565855"
From MaRDI portal
The following pages link to Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855):
Displayed 3 items.
- An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times (Q968014) (← links)
- An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time (Q991796) (← links)
- Extension of algorithm list scheduling for a semi-online scheduling problem (Q1011847) (← links)