Pages that link to "Item:Q1028485"
From MaRDI portal
The following pages link to On a parallel machine scheduling problem with equal processing times (Q1028485):
Displaying 11 items.
- Scheduling jobs with equal processing times and a single server on parallel identical machines (Q313819) (← links)
- Scheduling with multiple servers (Q612219) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- Fast LP models and algorithms for identical jobs on uniform parallel machines (Q727360) (← links)
- Scheduling equal-length jobs on identical parallel machines (Q1570817) (← links)
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time (Q1885337) (← links)
- Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan (Q2361139) (← links)
- Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
- Minimizing total tardiness on parallel machines with preemptions (Q2434279) (← links)
- Variants of Multi-resource Scheduling Problems with Equal Processing Times (Q3467836) (← links)
- A new polynomial algorithm for a parallel identical scheduling problem (Q3517881) (← links)