Improved algorithms for two-agent scheduling on an unbounded serial-batching machine
From MaRDI portal
Publication:2234745
DOI10.1016/J.DISOPT.2021.100655zbMATH Open1506.90101OpenAlexW3177347057MaRDI QIDQ2234745FDOQ2234745
Publication date: 19 October 2021
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2021.100655
Recommendations
- Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
- Two-agent scheduling on an unbounded serial batching machine
- Two-agent scheduling to minimize makespan and total completion time on a serial-batching machine
- scientific article; zbMATH DE number 7109369
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
Cites Work
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- Multiagent scheduling. Models and algorithms
- Scheduling Groups of Jobs on a Single Machine
- Title not available (Why is that?)
- Batch sizing and job sequencing on a single machine
- Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine
- A DP algorithm for minimizing makespan and total completion time on a series-batching machine
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
- Bounded serial-batching scheduling for minimizing maximum lateness and makespan
- Serial-batching scheduling with two agents to minimize makespan and maximum cost
- Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
Cited In (7)
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
- Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives
- Two-agent scheduling on an unbounded serial batching machine
- Two-agent scheduling to minimize makespan and total completion time on a serial-batching machine
- Title not available (Why is that?)
This page was built for publication: Improved algorithms for two-agent scheduling 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 Q2234745)
