Pages that link to "Item:Q3100480"
From MaRDI portal
The following pages link to Competitive Two-Agent Scheduling and Its Applications (Q3100480):
Displaying 50 items.
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263) (← links)
- Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (Q296690) (← links)
- Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
- A note on scheduling problems with competing agents and earliness minimization objectives (Q319703) (← links)
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling (Q320651) (← links)
- Two-agent scheduling in a flowshop (Q322895) (← links)
- Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
- Single machine scheduling with interfering job sets (Q336975) (← links)
- A scheduling problem with three competing agents (Q337134) (← links)
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness (Q339552) (← links)
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time (Q339589) (← links)
- An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650) (← links)
- Single machine scheduling problem with two synergetic agents and piece-rate maintenance (Q350484) (← links)
- Strategies in competing subset selection (Q367644) (← links)
- Single machine batch scheduling with two competing agents to minimize total flowtime (Q420859) (← links)
- Two-agent scheduling to minimize the total cost (Q421611) (← links)
- A competitive two-agent scheduling problem on parallel machines with release dates and preemption (Q460140) (← links)
- A single-machine bi-criterion scheduling problem with two agents (Q482429) (← links)
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
- Scheduling to minimize the maximum total completion time per machine (Q726222) (← links)
- Two-agent scheduling on uniform parallel machines with min-max criteria (Q744634) (← 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)
- Scheduling two agents with controllable processing times (Q976351) (← links)
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525) (← links)
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
- Competitive project scheduling on two unbounded parallel batch machines (Q1656205) (← links)
- Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness (Q1666548) (← links)
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine (Q1694914) (← links)
- A two-agent single-machine scheduling problem to minimize the total cost with release dates (Q1701559) (← links)
- A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
- A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms (Q1723459) (← links)
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← links)
- Competitive multi-agent scheduling with an iterative selection rule (Q1743639) (← links)
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks (Q1753463) (← links)
- Solving a two-agent single-machine scheduling problem considering learning effect (Q1762153) (← links)
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives (Q1788999) (← links)
- Approximation schemes for two-machine flow shop scheduling with two agents (Q1928514) (← links)
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan (Q1991261) (← links)
- Two-agent single-machine scheduling with cumulative deterioration (Q2001202) (← links)
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times (Q2009966) (← links)
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance (Q2012897) (← links)
- Nash equilibria for the multi-agent project scheduling problem with controllable processing times (Q2018940) (← links)
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work (Q2025084) (← links)
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301) (← links)
- Optimally rescheduling jobs with a last-in-first-out buffer (Q2066687) (← links)
- Two-agent integrated scheduling of production and distribution operations with fixed departure times (Q2076366) (← links)
