Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
From MaRDI portal
Publication:5058765
Recommendations
- Two-agent scheduling to minimize makespan and total completion time on a serial-batching machine
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
- Scheduling two-machine no-wait open shops to minimize makespan
- scientific article; zbMATH DE number 5260089
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- Competitive two-agent scheduling and its applications
Cites work
- scientific article; zbMATH DE number 1302193 (Why is no real title available?)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A multiple-criterion model for machine scheduling
- A new particle swarm optimization for the open shop scheduling problem
- Approximation Algorithms for Three-Machine Open Shop Scheduling
- Approximation algorithms for parallel open shop scheduling
- Competitive two-agent scheduling and its applications
- Fifty years of scheduling: a survey of milestones
- Flexible open shop scheduling problem to minimize makespan
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Multiagent scheduling. Models and algorithms
- Open Shop Scheduling to Minimize Finish Time
- Scheduling Problems with Two Competing Agents
- Scheduling two agents with controllable processing times
- The three-machine proportionate open shop and mixed shop minimum makespan problems
- Two-agent scheduling in a flowshop
- Two-agent scheduling to minimize the total cost
- Two-machine open-shop scheduling with rejection to minimize the makespan
Cited in
(10)- Online single-machine scheduling to minimize the linear combination of makespans of two agents
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
- A note on the single machine competitive scheduling problem with two-agent \(1\|\sum w^A_jc^A_j: f^B_{\max}\leq Q\)
- Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
- Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
- Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect
- Two-agent scheduling in a two-machine open shop
- Two competitive agents to minimize the weighted total late work and the total completion time
- Multitasking scheduling problems with two competitive agents
- Four decades of research on the open-shop scheduling problem to minimize the makespan
This page was built for publication: Competitive two-agent scheduling problems to minimize the weighted combination of makespans 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 Q5058765)
