Pages that link to "Item:Q2215193"

The following pages link to Serial-batching scheduling with two agents to minimize makespan and maximum cost (Q2215193):

Displaying 12 items.

• Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
• Two-agent scheduling to minimize the maximum cost with position-dependent jobs (Q1723571) (← 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 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)
• Improved algorithms for two-agent scheduling on an unbounded serial-batching machine (Q2234745) (← links)
• Scheduling two agents on uniform parallel machines with~makespan and cost functions (Q2434250) (← links)
• A batch scheduling problem with two agents (Q2788524) (← links)
• (Q5197262) (← links)
• Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives (Q6186161) (← links)
• Two-agent scheduling in a two-machine open shop (Q6491675) (← links)