Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
From MaRDI portal
Publication:1753463
DOI10.1016/J.EJOR.2017.01.010zbMath1403.90315OpenAlexW2569870123MaRDI QIDQ1753463
Byung-Cheon Choi, Myoung-Ju Park
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.01.010
Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Scheduling interfering job sets on parallel machines
- Approximation schemes for two-agent scheduling on parallel machines
- Two-agent single-machine scheduling problem with just-in-time jobs
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- Multi-agent single machine scheduling
- Competitive Two-Agent Scheduling and Its Applications
- Faster algorithms for the shortest path problem
- Scheduling Problems with Two Competing Agents
- Approximation Schemes for the Restricted Shortest Path Problem
- Multiagent Scheduling
This page was built for publication: Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks