Online single-machine scheduling to minimize the linear combination of makespans of two agents
From MaRDI portal
Publication:2234790
DOI10.1016/j.ipl.2021.106163zbMath1476.90128OpenAlexW3192717909MaRDI QIDQ2234790
Manzhan Gu, Kejun Zhao, Xi-wen Lu
Publication date: 19 October 2021
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106163
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Cites Work
- Two-agent scheduling in a flowshop
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
- Price of fairness in two-agent single-machine scheduling problems
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Scheduling two projects with controllable processing times in a single-machine environment
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- Two-agent scheduling on a single machine with release dates
- A subset-sum type formulation of a two-agent single-machine scheduling problem
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
- A multiple-criterion model for machine scheduling
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
- Two‐agent scheduling with linear resource‐dependent processing times
This page was built for publication: Online single-machine scheduling to minimize the linear combination of makespans of two agents
