Scheduling Problems with Two Competing Agents

DOI10.1287/OPRE.1030.0092MaRDI QIDQ3637420zbMATH OpenOpenAlexFDO

Authors Andrea Pacifici, Alessandro Agnetis, Pitu B. Mirchandani, Dario Pacciarelli

Publication date 10 July 2009

Published in Operations Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2108/34731

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Applications of game theory (91A80)

Recommendations

• Multitasking scheduling problems with two competitive agents
• A just-in-time scheduling problem with two competing agents
• Competitive two-agent scheduling and its applications
• Scheduling two competing agents when one agent has significantly fewer jobs
• Scheduling problems with two competing agents to minimized weighted earliness-tardiness
• Scheduling with two competing agents to minimize total weighted earliness
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
• A batch scheduling problem with two agents
• Two-agent scheduling of time-dependent jobs

Cited in

(only showing first 100 items - show all)

• Scheduling interfering job sets on parallel machines
• Single machine scheduling with aging effect and upper-bounded actual processing times
• Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities
• Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
• Complexities of four problems on two-agent scheduling
• Competitive project scheduling on two unbounded parallel batch machines
• Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness
• Two-agent parallel-machine scheduling with rejection
• Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
• 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
• Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost
• A note on two-agent scheduling with resource dependent release times on a single machine
• A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms
• Two-agent scheduling to minimize the maximum cost with position-dependent jobs
• Price of fairness in two-agent single-machine scheduling problems
• Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
• Competitive multi-agent scheduling with an iterative selection rule
• Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
• Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
• 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
• Solving a two-agent single-machine scheduling problem considering learning effect
• A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
• Approximation schemes for two-machine flow shop scheduling with two agents
• The symmetric quadratic knapsack problem: approximation and scheduling applications
• A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
• A note on competing-agent Pareto-scheduling
• Two-agent single-machine scheduling with cumulative deterioration
• 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
• Complexities of some problems on multi-agent scheduling on a single machine
• Nash equilibria for the multi-agent project scheduling problem with controllable processing times
• Single machine batch scheduling with two non-disjoint agents and splitable jobs
• Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
• Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
• Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
• A two-machine no-wait flow shop problem with two competing agents
• Two-agent integrated scheduling of production and distribution operations with fixed departure times
• Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
• The price of fairness for a two-agent scheduling game minimizing total completion time
• Due date assignment and two-agent scheduling under multitasking environment
• Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
• Vehicle scheduling problems with two agents on a line
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• Pareto-scheduling of two competing agents with their own equal processing times
• Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
• Routing and scheduling problems with two agents on a line-shaped network
• Single machine scheduling with non-availability interval and optional job rejection
• Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
• Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
• A survey of due-date related single-machine with two-agent scheduling problem
• Single-machine scheduling with multi-agents to minimize total weighted late work
• Serial-batching scheduling with two agents to minimize makespan and maximum cost
• Scheduling two projects with controllable processing times in a single-machine environment
• A just-in-time scheduling problem with two competing agents
• Online single-machine scheduling to minimize the linear combination of makespans of two agents
• Two competitive agents to minimize the weighted total late work and the total completion time
• Two-agent single-machine scheduling with assignable due dates
• Two-agent single-machine scheduling problem with just-in-time jobs
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
• A multi-agent system for the weighted earliness tardiness parallel machine problem
• A Lagrangian approach to single-machine scheduling problems with two competing agents
• Two-agent scheduling on a single machine with release dates
• A subset-sum type formulation of a two-agent single-machine scheduling problem
• 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
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Bicriteria scheduling of equal length jobs on uniform parallel machines
• An approximation algorithm for multi-agent scheduling on two uniform parallel machines
• An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines
• Scheduling with release dates and preemption to minimize multiple max-form objective functions
• Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design
• Two-agent scheduling with rejection on a single machine
• Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
• Two agent scheduling with a central selection mechanism
• Scheduling two agent task chains with a central selection mechanism
• A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work
• A note on the complexity of the problem of two-agent scheduling on a single machine
• Unary NP-hardness of minimizing the number of tardy jobs with deadlines
• Scheduling with two competing agents to minimize total weighted earliness
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
• Two-agent scheduling of time-dependent jobs
• Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans
• A note on a two-agent scheduling problem related to the total weighted late work
• Scheduling two agents on uniform parallel machines with~makespan and cost functions
• Single-machine multi-agent scheduling problems with a global objective function
• Unbounded parallel-batching scheduling with two competitive agents
• Bounded parallel-batching scheduling with two competing agents
• Scheduling two agents with sum-of-processing-times-based deterioration on a single machine
• Multi-agent scheduling on a single machine with max-form criteria
• Multi-agent single machine scheduling
• A market-based multi-agent system model for decentralized multi-project scheduling
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
• Scheduling with competing agents, total late work and job rejection
• Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
• A batch scheduling problem with two agents

This page was built for publication: Scheduling Problems with Two Competing Agents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637420)