Pages that link to "Item:Q1935796"
From MaRDI portal
The following pages link to Approximation schemes for two-agent scheduling on parallel machines (Q1935796):
Displaying 19 items.
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263) (← links)
- Two-agent single machine scheduling with forbidden intervals (Q902407) (← links)
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525) (← links)
- Two-agent parallel-machine scheduling with rejection (Q1676363) (← links)
- A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
- Competitive multi-agent scheduling with an iterative selection rule (Q1743639) (← links)
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks (Q1753463) (← links)
- Solving multi-objective parallel machine scheduling problem by a modified NSGA-II (Q1788959) (← links)
- Approximation schemes for two-machine flow shop scheduling with two agents (Q1928514) (← links)
- Vehicle scheduling problems with two agents on a line (Q2099389) (← links)
- Two-agent scheduling on a single machine with release dates (Q2273652) (← links)
- Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines (Q2289001) (← links)
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines (Q2311120) (← links)
- An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines (Q2317128) (← links)
- Two agent scheduling with a central selection mechanism (Q2355710) (← links)
- A Review for Submodular Optimization on Machine Scheduling Problems (Q3297835) (← links)
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621) (← links)
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization (Q6657877) (← links)
