Pages that link to "Item:Q2081468"

The following pages link to Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost (Q2081468):

Displaying 11 items.

• 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)
• Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217) (← links)
• Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan (Q2172079) (← 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)
• Online single-machine scheduling to minimize the linear combination of makespans of two agents (Q2234790) (← links)
• Scheduling two agents on uniform parallel machines with~makespan and cost functions (Q2434250) (← links)
• Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop (Q5058765) (← links)
• (Q5197262) (← links)
• Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives (Q6186161) (← links)