A note on the single machine competitive scheduling problem with two-agent 1\| w^A_jc^A_j: f^B_ Q

MaRDI QIDQ3110340zbMATH OpenFDO

Authors Jianqiu Li, Wenchang Luo

Publication date 27 January 2012

zbMATH Keywords

approximation algorithmscompetitive schedulingmultiple maintenances

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Single machine scheduling with two competing agents and equal job processing times
• Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
• Single machine just‐in‐time scheduling problems with two competing agents
• Scheduling two job families on a single machine with two competitive agents
• Competitive two-agent scheduling with release dates and preemption on a single machine

Cited in

(3)

• A Lagrangian approach to single-machine scheduling problems with two competing agents
• A subset-sum type formulation of a two-agent single-machine scheduling problem
• Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents

This page was built for publication: A note on the single machine competitive scheduling problem with two-agent \(1\|\sum w^A_jc^A_j: f^B_{\max}\leq Q\)

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