A competitive two-agent scheduling problem on parallel machines with release dates and preemption

DOI10.1155/2013/124083zbMath1296.90056OpenAlexW2009950250WikidataQ59022642 ScholiaQ59022642MaRDI QIDQ460140

Long Wan, Ya-wei Qi

Publication date: 13 October 2014

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/124083

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple version of Karzanov's blocking flow algorithm
• A note on the scheduling with two families of jobs
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
• A note on the complexity of the problem of two-agent scheduling on a single machine
• A multiple-criterion model for machine scheduling
• Multi-agent scheduling on a single machine with max-form criteria
• Multi-agent single machine scheduling
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Scheduling with Deadlines and Loss Functions
• Competitive Two-Agent Scheduling and Its Applications
• Scheduling Problems with Two Competing Agents
• Preemptive Scheduling with Due Dates
• Scheduling Independent Tasks with Due Times on a Uniform Processor System
• Preemptive Scheduling with Release Times, Deadlines, and Due Times
• Computing Maximal “Polymatroidal” Network Flows
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some simple scheduling algorithms