The following pages link to Multiagent Scheduling (Q5402189):
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)
- Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Two-agent scheduling in a flowshop (Q322895) (← links)
- Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
- Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria (Q337198) (← 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)
- Scheduling on parallel processors with varying processing times (Q1652222) (← links)
- Competitive project scheduling on two unbounded parallel batch machines (Q1656205) (← links)
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940) (← links)
- Two-agent parallel-machine scheduling with rejection (Q1676363) (← links)
- Precedence constrained parallel-machine scheduling of position-dependent jobs (Q1676479) (← 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)
- Single machine scheduling with a generalized job-dependent cumulative effect (Q1702657) (← links)
- Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times (Q1725594) (← links)
- Price of fairness in two-agent single-machine scheduling problems (Q1728475) (← links)
- A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection (Q1730596) (← links)
- Competitive multi-agent scheduling with an iterative selection rule (Q1743639) (← links)
- Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs (Q1751210) (← links)
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints (Q1751234) (← 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)
- Complexity of scheduling with proportional deterioration and release dates (Q1787790) (← links)
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan (Q1991261) (← links)
- A note on competing-agent Pareto-scheduling (Q1996756) (← links)
- Two-agent single-machine scheduling with cumulative deterioration (Q2001202) (← links)
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance (Q2012897) (← links)
- Complexities of some problems on multi-agent scheduling on a single machine (Q2014052) (← links)
- Single machine batch scheduling with two non-disjoint agents and splitable jobs (Q2023129) (← 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)
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion (Q2030503) (← links)
- Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads (Q2075458) (← links)
- Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect (Q2075460) (← links)
- A two-machine no-wait flow shop problem with two competing agents (Q2075466) (← links)
- A unified analysis for scheduling problems with variable processing times (Q2076372) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost (Q2081468) (← links)
- The price of fairness for a two-agent scheduling game minimizing total completion time (Q2082220) (← links)
- Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217) (← links)
- Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times (Q2168720) (← 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)
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices (Q2190797) (← links)
- Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
- Serial-batching scheduling with two agents to minimize makespan and maximum cost (Q2215193) (← links)