Pages that link to "Item:Q3319773"
From MaRDI portal
The following pages link to Bounds for naive multiple machine scheduling with release times and deadlines (Q3319773):
Displaying 14 items.
- Improved approximation algorithms for parallel machine scheduling with release dates and job rejection (Q681293) (← links)
- Energetic reasoning revisited: Application to parallel machine scheduling (Q835610) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times (Q1318658) (← links)
- Scheduling on uniform parallel machines to minimize maximum lateness (Q1577473) (← links)
- Minimizing makespan on parallel machines subject to release dates and delivery times (Q1607981) (← links)
- Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Makespan minimization on uniform parallel machines with release times (Q1877043) (← links)
- Busy time scheduling on a bounded number of machines (extended abstract) (Q2405306) (← links)
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392) (← links)
- Approximation scheduling algorithms: a survey (Q4207781) (← links)
- Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times (Q4399116) (← links)
- Task scheduling in networks (Q5054769) (← links)