A scheduling problem with three competing agents
From MaRDI portal
Publication:337134
DOI10.1016/j.cor.2014.06.011zbMath1348.90283OpenAlexW2035244286MaRDI QIDQ337134
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.06.011
Related Items (1)
Cites Work
- Unnamed Item
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Single-machine scheduling with two competing agents and learning consideration
- Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
- A single-machine scheduling problem with two-agent and deteriorating jobs
- A two-machine flowshop problem with two agents
- A note on the scheduling with two families of jobs
- Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
- Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Machine scheduling with an availability constraint
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling on semi-identical processors
- Planning Machine Maintenance in Two-Machine Shop Scheduling
- Scheduling Problems with Two Competing Agents
- Minimizing Weighted Completion Times with Deadlines
This page was built for publication: A scheduling problem with three competing agents
