Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
From MaRDI portal
Publication:5012893
DOI10.1142/S0217595920500463zbMATH Open1478.90037MaRDI QIDQ5012893FDOQ5012893
Authors: Ren-Xia Chen, Shisheng Li 
Publication date: 26 November 2021
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Recommendations
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
- Two competitive agents to minimize the weighted total late work and the total completion time
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
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
- 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
- Review of the ordered and proportionate flow shop scheduling research
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A competitive scheduling problem and its relevance to UMTS channel assignment
- A note: minimizing maximum earliness on a proportionate flowshop
- Single Machine Scheduling to Minimize Total Late Work
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Minimizing total weighted completion time in a proportionate flow shop
- The just-in-time scheduling problem in a flow-shop scheduling system
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
- Joint Optimization of Production Plan and Preventive Maintenance Schedule by Stackelberg Game
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- The proportionate flow shop total tardiness problem
- Scheduling. Theory, algorithms, and systems
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
- A two-agent single-machine scheduling problem with late work criteria
- Single-machine scheduling with multi-agents to minimize total weighted late work
- A survey of due-date related single-machine with two-agent scheduling problem
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
- Regular scheduling measures on proportionate flowshop with job rejection
- Two-agent advertisement scheduling on physical books to maximize the total profit
- Proportionate flow shop: new complexity results and models with due date assignment
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- Due date-related scheduling with two agents. Models and algorithms
- Proportionate flow shop scheduling with rejection
Cited In (3)
This page was built for publication: Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012893)
