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 workSingle machine scheduling with two competing agents, arbitrary release dates and unit processing timesTwo-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependentA new approximation algorithm for multi-agent scheduling to minimize makespan on two machinesFast approximation algorithms for bi-criteria scheduling with machine assignment costsPareto-scheduling of two competing agents with their own equal processing timesProportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobsCompetitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shopMulti-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobsMultitasking scheduling problems with two competitive agentsSingle machine scheduling with two competing agents and equal job processing timesA note on scheduling problems with competing agents and earliness minimization objectivesDesign of automated negotiation mechanisms for decentralized heterogeneous machine schedulingTwo-agent scheduling in a flowshopScheduling two job families on a single machine with two competitive agentsSingle machine scheduling with interfering job setsA scheduling problem with three competing agentsScheduling problems with two competing agents to minimized weighted earliness-tardinessTwo-agent singe-machine scheduling with release times to minimize the total weighted completion timeAn investigation on a two-agent single-machine scheduling problem with unequal release datesCompetitive project scheduling on two unbounded parallel batch machinesSingle machine scheduling problem with two synergetic agents and piece-rate maintenanceTwo-agent flowshop scheduling to maximize the weighted number of just-in-time jobsSum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardinessStrategies in competing subset selectionTwo-agent scheduling of time-dependent jobsApproximation schemes for two-machine flow shop scheduling with two agentsTwo-agent scheduling with agent specific batches on an unbounded serial batching machineTwo‐agent scheduling with linear resource‐dependent processing timesA survey of due-date related single-machine with two-agent scheduling problemSingle-machine past-sequence-dependent setup times scheduling with resource allocation and learning effectTwo-agent single-machine scheduling with release dates to minimize the makespanTwo-agent single-machine scheduling with a rate-modifying activityCompetitive two-agent scheduling with release dates and preemption on a single machineCompetitive two-agent scheduling with deteriorating jobs on a single parallel-batching machineTwo-Machine and Two-Agent Flow Shop with Special Processing Times StructuresSingle-machine scheduling with multi-agents to minimize total weighted late workSingle machine batch scheduling with two competing agents to minimize total flowtimeSingle-machine scheduling of multiple projects with controllable processing timesTwo-agent scheduling to minimize the total costTwo-agent single machine scheduling with forbidden intervalsA two-agent single-machine scheduling problem to minimize the total cost with release datesA two-agent single-machine scheduling problem with late work criteriaScheduling two agents on uniform parallel machines with~makespan and cost functionsUnbounded parallel-batching scheduling with two competitive agentsBounded parallel-batching scheduling with two competing agentsScheduling two projects with controllable processing times in a single-machine environmentA competitive two-agent scheduling problem on parallel machines with release dates and preemptionA single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithmsScheduling two agents with sum-of-processing-times-based deterioration on a single machineTwo-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectivesA single-machine bi-criterion scheduling problem with two agentsA just-in-time scheduling problem with two competing agentsPareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum costOnline single-machine scheduling to minimize the linear combination of makespans of two agentsCompetitive multi-agent scheduling with an iterative selection ruleTwo competitive agents to minimize the weighted total late work and the total completion timeA further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespanTwo-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizesTwo-agent parallel machine scheduling with a restricted number of overlapped reserved tasksTwo-agent single-machine scheduling with assignable due datesTwo-agent single-machine scheduling problem with just-in-time jobsTwo-agent single-machine scheduling with cumulative deteriorationA common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problemsSolving a two-agent single-machine scheduling problem considering learning effectGroup Scheduling with Two Competing Agents on a Single MachineA honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready timesA two-agent single machine scheduling problem with due-window assignment and a common flow-allowanceScheduling two agents with controllable processing timesNash equilibria for the multi-agent project scheduling problem with controllable processing timesTwo-agent scheduling on a single machine with release datesTwo-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late workApproximation algorithms for multi-agent scheduling to minimize total weighted completion timeTwo-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobsA subset-sum type formulation of a two-agent single-machine scheduling problemScheduling to minimize the maximum total completion time per machineA note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectivesA Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work CriterionTwo-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteriaND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum costThe complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobsTwo approximation algorithms for two-agent scheduling on parallel machines to minimize makespanOnline scheduling of jobs with favorite machinesTwo-agent scheduling on uniform parallel machines with min-max criteriaAn approximation algorithm for multi-agent scheduling on two uniform parallel machinesOptimally rescheduling jobs with a last-in-first-out bufferAn algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machinesTwo-agent integrated scheduling of production and distribution operations with fixed departure timesScheduling with release dates and preemption to minimize multiple max-form objective functionsTwo-agent scheduling on a bounded series-batch machine to minimize makespan and maximum costDue date assignment and two-agent scheduling under multitasking environmentTwo-agent scheduling with rejection on a single machineApproximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion timeTwo-agent single-machine scheduling with release dates and preemption to minimize the maximum latenessVehicle scheduling problems with two agents on a lineTwo agent scheduling with a central selection mechanismA 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