An ordered flow shop with two agents
From MaRDI portal
Recommendations
Cites work
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Scheduling Problems with Two Competing Agents
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Single-machine multi-agent scheduling problems with a global objective function
- Single-machine scheduling with two competing agents and learning consideration
- Two-agent single-machine scheduling with assignable due dates
Cited in
(7)- Approximation schemes for two-machine flow shop scheduling with two agents
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- Two-agent scheduling in a flowshop
- Two-machine ordered flow shop scheduling with generalized due dates
- Two-machine and two-agent flow shop with special processing times structures
- Two-agent scheduling in a two-machine open shop
- A two-machine flowshop problem with two agents
This page was built for publication: An ordered flow shop with two agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5506757)
