Pages that link to "Item:Q2434250"
From MaRDI portal
The following pages link to Scheduling two agents on uniform parallel machines with~makespan and cost functions (Q2434250):
Displayed 11 items.
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
- Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
- Two-agent scheduling on uniform parallel machines with min-max criteria (Q744634) (← links)
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks (Q1753463) (← links)
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301) (← links)
- A survey of due-date related single-machine with two-agent scheduling problem (Q2190270) (← links)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria (Q2283297) (← links)
- Bicriteria scheduling of equal length jobs on uniform parallel machines (Q2307491) (← links)
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines (Q2311120) (← links)
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621) (← links)
