Pages that link to "Item:Q3113703"
From MaRDI portal
The following pages link to A fast algorithm for multi-machine scheduling problems with jobs of equal processing times (Q3113703):
Displaying 12 items.
- A model for minimizing active processor time (Q487001) (← links)
- Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem (Q490323) (← links)
- Minimizing the number of machines for scheduling jobs with equal processing times (Q1042179) (← links)
- Scheduling equal length jobs with eligibility restrictions (Q2288997) (← links)
- Faster algorithms for bicriteria scheduling of identical jobs on uniform machines (Q2691455) (← links)
- An improved LS algorithm for the problem of scheduling multi groups of jobs on multi processors at the same speed (Q2867376) (← links)
- (Q3095030) (← links)
- Variants of Multi-resource Scheduling Problems with Equal Processing Times (Q3467836) (← links)
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs (Q4729336) (← links)
- Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times (Q5943828) (← links)
- Equitable scheduling on a single machine (Q6103750) (← links)
- Bicriteria multi-machine scheduling with equal processing times subject to release dates (Q6145328) (← links)
