Pages that link to "Item:Q1870003"
From MaRDI portal
The following pages link to An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines (Q1870003):
Displaying 12 items.
- Improving the preemptive bound for the single machine dynamic maximum lateness problem (Q614050) (← links)
- Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines. (Q703238) (← links)
- Energetic reasoning revisited: Application to parallel machine scheduling (Q835610) (← links)
- Search tree based approaches for parallel machine scheduling (Q941538) (← links)
- Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem (Q1711441) (← links)
- Optimal parallel machines scheduling with availability constraints (Q1775061) (← links)
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392) (← links)
- Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time (Q4661237) (← links)
- Algorithms to compute the energetic lower bounds of the cumulative scheduling problem (Q6581391) (← links)
- Minimization of maximum lateness on parallel machines with a single server and job release dates (Q6614640) (← links)
