Competitive project scheduling on two unbounded parallel batch machines
From MaRDI portal
Publication:1656205
DOI10.1007/s40305-017-0180-4zbMath1413.90096OpenAlexW2768148235MaRDI QIDQ1656205
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
Cites Work
- Online over time scheduling on parallel-batch machines: a survey
- Nash equilibria in competitive project scheduling
- Scheduling a batching machine
- 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
- Project scheduling under competition
- Scheduling Problems with Two Competing Agents
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Multiagent Scheduling