Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
From MaRDI portal
Recommendations
- Two-agent scheduling on an unbounded serial batching 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
- scientific article; zbMATH DE number 7109369
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
Cited in
(9)- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
- Improved algorithms for two-agent scheduling on an unbounded serial-batching machine
- Unbounded parallel-batching scheduling with two competitive agents
- Two-agent scheduling on an unbounded serial batching machine
- scientific article; zbMATH DE number 7109369 (Why is no real title available?)
- Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives
- A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
This page was built for publication: Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034766)
