Pages that link to "Item:Q983625"
From MaRDI portal
The following pages link to Parallel machine scheduling with multiple unloading servers (Q983625):
Displaying 16 items.
- Scheduling jobs with equal processing times and a single server on parallel identical machines (Q313819) (← links)
- Scheduling with multiple servers (Q612219) (← links)
- A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server (Q1634053) (← links)
- Multiprofessor scheduling (Q1686063) (← links)
- MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server (Q1761182) (← links)
- A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times (Q1799381) (← links)
- Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers (Q2026982) (← links)
- Single-server parallel-machine scheduling with loading and unloading times (Q2355978) (← links)
- Mixed integer programming formulations for the biomass truck scheduling problem (Q2358168) (← 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)
- General variable neighborhood search for the parallel machine scheduling problem with two common servers (Q6063516) (← links)
- Self-adaptive general variable neighborhood search algorithm for parallel machine scheduling with unrelated servers (Q6551084) (← links)
- Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations (Q6568449) (← links)