Competitive project scheduling on two unbounded parallel batch machines

DOI10.1007/S40305-017-0180-4MaRDI QIDQ1656205zbMATH OpenOpenAlexFDO

Authors Lingfa Lu, Li-Qi Zhang

Publication date 10 August 2018

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40305-017-0180-4

zbMATH Keywords

competitionproject schedulingparallel batch machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Project scheduling under competition
• Unbounded parallel-batching scheduling with two competitive agents
• Bounded parallel-batching scheduling with two competing agents
• Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
• The competing job sets scheduling problems with two types of release dates on batching machine

Cites work

• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
• Competitive two-agent scheduling and its applications
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Multiagent scheduling. Models and algorithms
• Nash equilibria in competitive project scheduling
• Online over time scheduling on parallel-batch machines: a survey
• Project scheduling under competition
• Scheduling Problems with Two Competing Agents
• Scheduling a batching machine

Cited in

(1)

• Project scheduling under competition

This page was built for publication: Competitive project scheduling on two unbounded parallel batch machines

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