Pages that link to "Item:Q4658402"
From MaRDI portal
The following pages link to An approximation algorithm for parallel machine scheduling with a common server (Q4658402):
Displayed 11 items.
- Scheduling jobs with equal processing times and a single server on parallel identical machines (Q313819) (← links)
- Parallel machine scheduling with multiple unloading servers (Q983625) (← links)
- MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server (Q1761182) (← links)
- Complexity results for flow-shop problems with a single server (Q1772843) (← links)
- Single-server parallel-machine scheduling with loading and unloading times (Q2355978) (← links)
- Minimizing total weighted completion time approximately for the parallel machine problem with a single server (Q2448861) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Online algorithms for scheduling two parallel machines with a single server (Q2806439) (← links)
- Parallel Machine Scheduling with a Single Server: Loading and Unloading (Q2867112) (← links)
- An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times (Q2931175) (← links)
- SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS (Q5370786) (← links)