Pages that link to "Item:Q2172079"
From MaRDI portal
The following pages link to Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan (Q2172079):
Displaying 13 items.
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
- Two-agent scheduling on uniform parallel machines with min-max criteria (Q744634) (← links)
- Two-agent scheduling to minimize the maximum cost with position-dependent jobs (Q1723571) (← links)
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives (Q1788999) (← links)
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan (Q1991261) (← links)
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost (Q2081468) (← links)
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217) (← links)
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives (Q2176838) (← links)
- Serial-batching scheduling with two agents to minimize makespan and maximum cost (Q2215193) (← links)
- Scheduling two agents on uniform parallel machines with~makespan and cost functions (Q2434250) (← links)
- Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
- Faster algorithms for bicriteria scheduling of identical jobs on uniform machines (Q2691455) (← links)
- (Q5197262) (← links)
