Pages that link to "Item:Q4429690"
From MaRDI portal
The following pages link to Minimizing Total Completion Time on Parallel Machines with Deadline Constraints (Q4429690):
Displaying 5 items.
- Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (Q296690) (← links)
- Total completion time minimization on multiple machines subject to machine availability and makespan constraints (Q319146) (← links)
- Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints (Q631768) (← links)
- Parallel machine makespan minimization subject to machine availability and total completion time constraints (Q2304115) (← links)
- Scheduling on parallel machines to minimise maximum lateness for the customer order problem (Q2873094) (← links)
