Competitive Two-Agent Scheduling and Its Applications
From MaRDI portal
Publication:3100480
DOI10.1287/opre.1090.0744zbMath1233.90163OpenAlexW2165852962MaRDI QIDQ3100480
Joseph Y.-T. Leung, Guohua Wan, Michael L. Pinedo
Publication date: 24 November 2011
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1090.0744
Related Items (97)
Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Single machine scheduling with two competing agents, arbitrary release dates and unit processing times ⋮ Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent ⋮ A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines ⋮ Fast approximation algorithms for bi-criteria scheduling with machine assignment costs ⋮ Pareto-scheduling of two competing agents with their own equal processing times ⋮ Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ Multitasking scheduling problems with two competitive agents ⋮ Single machine scheduling with two competing agents and equal job processing times ⋮ A note on scheduling problems with competing agents and earliness minimization objectives ⋮ Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling ⋮ Two-agent scheduling in a flowshop ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ Single machine scheduling with interfering job sets ⋮ A scheduling problem with three competing agents ⋮ Scheduling problems with two competing agents to minimized weighted earliness-tardiness ⋮ Two-agent singe-machine scheduling with release times to minimize the total weighted completion time ⋮ An investigation on a two-agent single-machine scheduling problem with unequal release dates ⋮ Competitive project scheduling on two unbounded parallel batch machines ⋮ Single machine scheduling problem with two synergetic agents and piece-rate maintenance ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness ⋮ Strategies in competing subset selection ⋮ Two-agent scheduling of time-dependent jobs ⋮ Approximation schemes for two-machine flow shop scheduling with two agents ⋮ Two-agent scheduling with agent specific batches on an unbounded serial batching machine ⋮ Two‐agent scheduling with linear resource‐dependent processing times ⋮ A survey of due-date related single-machine with two-agent scheduling problem ⋮ Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ Two-agent single-machine scheduling with a rate-modifying activity ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Single machine batch scheduling with two competing agents to minimize total flowtime ⋮ Single-machine scheduling of multiple projects with controllable processing times ⋮ Two-agent scheduling to minimize the total cost ⋮ Two-agent single machine scheduling with forbidden intervals ⋮ A two-agent single-machine scheduling problem to minimize the total cost with release dates ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Scheduling two agents on uniform parallel machines with~makespan and cost functions ⋮ Unbounded parallel-batching scheduling with two competitive agents ⋮ Bounded parallel-batching scheduling with two competing agents ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ A competitive two-agent scheduling problem on parallel machines with release dates and preemption ⋮ A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms ⋮ Scheduling two agents with sum-of-processing-times-based deterioration on a single machine ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ A single-machine bi-criterion scheduling problem with two agents ⋮ A just-in-time scheduling problem with two competing agents ⋮ Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost ⋮ Online single-machine scheduling to minimize the linear combination of makespans of two agents ⋮ Competitive multi-agent scheduling with an iterative selection rule ⋮ Two competitive agents to minimize the weighted total late work and the total completion time ⋮ A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks ⋮ Two-agent single-machine scheduling with assignable due dates ⋮ Two-agent single-machine scheduling problem with just-in-time jobs ⋮ Two-agent single-machine scheduling with cumulative deterioration ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ Solving a two-agent single-machine scheduling problem considering learning effect ⋮ Group Scheduling with Two Competing Agents on a Single Machine ⋮ A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times ⋮ A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance ⋮ Scheduling two agents with controllable processing times ⋮ Nash equilibria for the multi-agent project scheduling problem with controllable processing times ⋮ Two-agent scheduling on a single machine with release dates ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ Approximation algorithms for multi-agent scheduling to minimize total weighted completion time ⋮ Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs ⋮ A subset-sum type formulation of a two-agent single-machine scheduling problem ⋮ Scheduling to minimize the maximum total completion time per machine ⋮ A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives ⋮ A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion ⋮ Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria ⋮ ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost ⋮ The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs ⋮ Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan ⋮ Online scheduling of jobs with favorite machines ⋮ Two-agent scheduling on uniform parallel machines with min-max criteria ⋮ An approximation algorithm for multi-agent scheduling on two uniform parallel machines ⋮ Optimally rescheduling jobs with a last-in-first-out buffer ⋮ An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines ⋮ Two-agent integrated scheduling of production and distribution operations with fixed departure times ⋮ Scheduling with release dates and preemption to minimize multiple max-form objective functions ⋮ Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost ⋮ Due date assignment and two-agent scheduling under multitasking environment ⋮ Two-agent scheduling with rejection on a single machine ⋮ Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time ⋮ Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness ⋮ Vehicle scheduling problems with two agents on a line ⋮ Two agent scheduling with a central selection mechanism ⋮ A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
This page was built for publication: Competitive Two-Agent Scheduling and Its Applications
