Pages that link to "Item:Q5963621"
From MaRDI portal
The following pages link to Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621):
Displaying 3 items.
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance (Q2012897) (← links)
- Online single-machine scheduling to minimize the linear combination of makespans of two agents (Q2234790) (← links)
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work (Q2359798) (← links)
