Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
From MaRDI portal
Publication:2081468
DOI10.1016/j.dam.2022.08.001zbMath1498.90083OpenAlexW4292702007WikidataQ114191393 ScholiaQ114191393MaRDI QIDQ2081468
Publication date: 13 October 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.08.001
Related Items (1)
Cites Work
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
- Sequencing games
- Bounded serial-batching scheduling for minimizing maximum lateness and makespan
- On games corresponding to sequencing situations with ready times
- Complexities of some problems on multi-agent scheduling on a single machine
- Serial-batching scheduling with two agents to minimize makespan and maximum cost
- Improved algorithms for two-agent scheduling on an unbounded serial-batching machine
- Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
- 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
- Multicriteria scheduling
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
- Multiagent Scheduling
This page was built for publication: Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
