Pages that link to "Item:Q596460"
From MaRDI portal
The following pages link to Lower bounds for scheduling on identical parallel machines with heads and tails (Q596460):
Displaying 16 items.
- Energetic reasoning revisited: Application to parallel machine scheduling (Q835610) (← links)
- Optimal scheduling of a two-stage hybrid flow shop (Q857819) (← links)
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem (Q882647) (← links)
- Lower bounds for parallel machine scheduling problems (Q947338) (← links)
- Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness (Q1011327) (← links)
- Maximizing the minimum completion time on parallel machines (Q1029565) (← links)
- A general lower bound for the makespan problem (Q1266724) (← links)
- An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines (Q1870003) (← links)
- On lower and upper bounds for single machine parallel batch scheduling (Q2091210) (← links)
- Online scheduling on two parallel machines with release dates and delivery times (Q2355989) (← links)
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392) (← links)
- Fast lifting procedures for the bin packing problem (Q2581316) (← links)
- Online Scheduling on Two Parallel Machines with Release Times and Delivery Times (Q2867111) (← links)
- Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop (Q2890475) (← links)
- Tight bounds for the identical parallel machine scheduling problem (Q3429035) (← links)
- Algorithms to compute the energetic lower bounds of the cumulative scheduling problem (Q6581391) (← links)
