Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
From MaRDI portal
Publication:5058765
DOI10.1080/0305215X.2017.1332762OpenAlexW2625785008MaRDI QIDQ5058765
Xingong Zhang, Danyu Bai, Chin-Chia Wu, Fuhong Jiang
Publication date: 23 December 2022
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2017.1332762
Related Items (5)
Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint ⋮ Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect ⋮ Multitasking scheduling problems with two competitive agents ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Two competitive agents to minimize the weighted total late work and the total completion time
Cites Work
- Unnamed Item
- Two-machine open-shop scheduling with rejection to minimize the makespan
- The three-machine proportionate open shop and mixed shop minimum makespan problems
- Two-agent scheduling in a flowshop
- Flexible open shop scheduling problem to minimize makespan
- Two-agent scheduling to minimize the total cost
- Scheduling two agents with controllable processing times
- Approximation algorithms for parallel open shop scheduling
- 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
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- A new particle swarm optimization for the open shop scheduling problem
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Competitive Two-Agent Scheduling and Its Applications
- Fifty years of scheduling: a survey of milestones
- Scheduling Problems with Two Competing Agents
- Open Shop Scheduling to Minimize Finish Time
- Approximation Algorithms for Three-Machine Open Shop Scheduling
- Multiagent Scheduling
This page was built for publication: Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
