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 QIDQ5058765FDOQ5058765
Authors: Fuhong Jiang, Zhang Xingong, Danyu Bai, Chin-Chia Wu 
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
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
- 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
- Competitive two-agent scheduling and its applications
- Scheduling Problems with Two Competing Agents
- Multiagent scheduling. Models and algorithms
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Two-machine open-shop scheduling with rejection to minimize the makespan
- Open Shop Scheduling to Minimize Finish Time
- Fifty years of scheduling: a survey of milestones
- The three-machine proportionate open shop and mixed shop minimum makespan problems
- Approximation Algorithms for Three-Machine Open Shop Scheduling
- Two-agent scheduling in a flowshop
- Two-agent scheduling to minimize the total cost
- Title not available (Why is that?)
- Scheduling two agents with controllable processing times
- A new particle swarm optimization for the open shop scheduling problem
- Flexible open shop scheduling problem to minimize makespan
- Approximation algorithms for parallel open shop scheduling
Cited In (7)
- Two competitive agents to minimize the weighted total late work and the total completion time
- Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
- Multitasking scheduling problems with two competitive agents
- A note on the single machine competitive scheduling problem with two-agent \(1\|\sum w^A_jc^A_j: f^B_{\max}\leq Q\)
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Two-agent scheduling in a two-machine open shop
- Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect
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)
