Two-agent scheduling in a two-machine open shop
From MaRDI portal
Recommendations
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
- Two-agent scheduling in a flowshop
- Approximation schemes for two-machine flow shop scheduling with two agents
- Approximation schemes for two-agent scheduling on parallel machines
- Scheduling Problems with Two Competing Agents
Cites work
- A multiple-criterion model for machine scheduling
- A note on competing-agent Pareto-scheduling
- A note on the scheduling with two families of jobs
- An ordered flow shop with two agents
- Approximation schemes for two-machine flow shop scheduling with two agents
- Bounded parallel-batching scheduling with two competing agents
- Competitive two-agent scheduling and its applications
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- Multiagent scheduling. Models and algorithms
- Multicriteria scheduling
- Online single-machine scheduling to minimize the linear combination of makespans of two agents
- Open Shop Scheduling to Minimize Finish Time
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
- Scheduling interfering job sets on parallel machines
- Scheduling Problems with Two Competing Agents
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- Scheduling. Theory, algorithms, and systems
- Serial-batching scheduling with two agents to minimize makespan and maximum cost
- Single-machine scheduling with two competing agents and learning consideration
- The two-machine open shop problem: To fit or not to fit, that is the question
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
- Two-agent scheduling in a flowshop
- Two-agent scheduling on uniform parallel machines with min-max criteria
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Two-agent scheduling to minimize the total cost
- Two-machine and two-agent flow shop with special processing times structures
Cited in
(2)
This page was built for publication: Two-agent scheduling in a two-machine open shop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6491675)
