Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs

Related Items (1)

Minimizing total weighted late work on a single-machine with non-availability intervals

Cites Work

The just-in-time scheduling problem in a flow-shop scheduling system
A note: minimizing maximum earliness on a proportionate flowshop
Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
Minimizing total weighted completion time in a proportionate flow shop
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
Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
The proportionate flow shop total tardiness problem
A survey of due-date related single-machine with two-agent scheduling problem
Single-machine scheduling with multi-agents to minimize total weighted late work
A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
Due date-related scheduling with two agents. Models and algorithms
Regular scheduling measures on proportionate flowshop with job rejection
Two-agent scheduling problems on a single-machine to minimize the total weighted late work
A note on the complexity of the problem of two-agent scheduling on a single machine
A multiple-criterion model for machine scheduling
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
A competitive scheduling problem and its relevance to UMTS channel assignment
Scheduling Problems with Two Competing Agents
Single Machine Scheduling to Minimize Total Late Work
A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion
Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit
Proportionate flow shop: New complexity results and models with due date assignment
Joint Optimization of Production Plan and Preventive Maintenance Schedule by Stackelberg Game
Proportionate Flow Shop Scheduling with Rejection
Multiagent Scheduling
Scheduling

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