Pages that link to "Item:Q2434316"

The following pages link to Bounded parallel-batching scheduling with two competing agents (Q2434316):

Displaying 19 items.

• A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263) (← links)
• Two-agent scheduling in a flowshop (Q322895) (← links)
• Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
• Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
• Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent (Q827243) (← links)
• Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
• Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine (Q1694914) (← links)
• Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← 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 of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan (Q2172079) (← links)
• Two-agent scheduling on a single machine with release dates (Q2273652) (← links)
• An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines (Q2317128) (← links)
• Multitasking scheduling problems with two competitive agents (Q5059462) (← links)
• Group Scheduling with Two Competing Agents on a Single Machine (Q5174413) (← links)
• Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621) (← links)
• Two-agent scheduling in a two-machine open shop (Q6491675) (← links)