Pages that link to "Item:Q2434303"
From MaRDI portal
The following pages link to Unbounded parallel-batching scheduling with two competitive agents (Q2434303):
Displayed 31 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)
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
- Two-agent single machine scheduling with forbidden intervals (Q902407) (← 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)
- A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← 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)
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance (Q2012897) (← links)
- Single machine batch scheduling with two non-disjoint agents and splitable jobs (Q2023129) (← links)
- Two-agent integrated scheduling of production and distribution operations with fixed departure times (Q2076366) (← links)
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan (Q2172079) (← links)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
- Two-agent scheduling on a single machine with release dates (Q2273652) (← links)
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria (Q2283297) (← links)
- Unbounded parallel-batch scheduling with drop-line tasks (Q2304116) (← links)
- An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines (Q2317128) (← links)
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
- Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
- Two-agent vehicle scheduling problem on a line-shaped network (Q2691417) (← links)
- Multitasking scheduling problems with two competitive agents (Q5059462) (← links)
- Group Scheduling with Two Competing Agents on a Single Machine (Q5174413) (← links)
- Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times (Q5865923) (← links)
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621) (← links)
- Two‐agent scheduling with linear resource‐dependent processing times (Q6072167) (← links)
