A three-agent scheduling problem for minimizing the flow time on two machines
From MaRDI portal
Recommendations
- A lower bound for minimizing the total completion time of a three-agent scheduling problem
- Three-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times
- A scheduling problem with three competing agents
- The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Two-agent scheduling in a flowshop
- Solving constrained flow-shop scheduling problems with three machines
- Three-machine flowshop stochastic scheduling to minimize distribution of schedule length
- Approximation schemes for two-machine flow shop scheduling with two agents
- Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
Cited in
(4)- A lower bound for minimizing the total completion time of a three-agent scheduling problem
- A scheduling problem with three competing agents
- A makespan minimization problem for versatile developers in the game industry
- A job scheduling and rejection problem considering self-contained and cross-functional jobs
This page was built for publication: A three-agent scheduling problem for minimizing the flow time on two machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5109775)
