Pages that link to "Item:Q744634"
From MaRDI portal
The following pages link to Two-agent scheduling on uniform parallel machines with min-max criteria (Q744634):
Displayed 12 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)
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
- A two-agent single-machine scheduling problem to minimize the total cost with release dates (Q1701559) (← links)
- Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost (Q1706684) (← links)
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← links)
- Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs (Q1751210) (← 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)
- Bicriteria scheduling of equal length jobs on uniform parallel machines (Q2307491) (← links)
- Scheduling with two competing agents to minimize total weighted earliness (Q2399317) (← links)
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621) (← links)