Pages that link to "Item:Q3502134"
From MaRDI portal
The following pages link to Tight bounds for the identical parallel machine‐scheduling problem: Part II (Q3502134):
Displaying 14 items.
- Relaxations and exact solution of the variable sized bin packing problem (Q535302) (← links)
- Lower bounds for scheduling on identical parallel machines with heads and tails (Q596460) (← links)
- A characterization of optimal multiprocessor schedules and new dominance rules (Q830925) (← links)
- Maximizing the minimum completion time on parallel machines (Q1029565) (← links)
- Heuristics and exact methods for number partitioning (Q1038378) (← links)
- Improved bounds on relaxations of a parallel machine scheduling problem (Q1383802) (← links)
- An exact algorithm for the identical parallel machine scheduling problem. (Q1416605) (← links)
- FPTAS for the two identical parallel machine problem with a single operator under the free changing mode (Q1752167) (← links)
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem (Q1762154) (← links)
- MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints (Q2421327) (← links)
- A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts (Q2669559) (← links)
- Tight bounds for the identical parallel machine scheduling problem (Q3429035) (← links)
- A simulation‐based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations (Q5416762) (← links)
- Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods (Q6090983) (← links)
