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

DOI10.1155/2013/124083zbMATH Open1296.90056OpenAlexW2009950250WikidataQ59022642 ScholiaQ59022642MaRDI QIDQ460140FDOQ460140

Yawei Qi, Long Wan

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) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (2)

• A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
• Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks

This page was built for publication: A competitive two-agent scheduling problem on parallel machines with release dates and preemption

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