A subset-sum type formulation of a two-agent single-machine scheduling problem

DOI10.1016/j.ipl.2019.105886zbMath1481.90165OpenAlexW2988062559MaRDI QIDQ2281162

Antonio Fuduli, Matteo Avolio

Publication date: 19 December 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2019.105886

zbMATH Keywords

schedulingsingle-machinecompletion timesubset-sum

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Spherical separation with infinitely far center ⋮ A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem ⋮ Online single-machine scheduling to minimize the linear combination of makespans of two agents

Cites Work

• Two-agent scheduling to minimize the total cost
• Single-machine multi-agent scheduling problems with a global objective function
• Competitive Two-Agent Scheduling and Its Applications
• Scheduling Problems with Two Competing Agents
• Scheduling
• Unnamed Item
• Unnamed Item

This page was built for publication: A subset-sum type formulation of a two-agent single-machine scheduling problem