Due date-related scheduling with two agents. Models and algorithms
From MaRDI portal
Publication:2303121
Recommendations
- CON/SLK due date assignment and scheduling on a single machine with two agents
- A survey of due-date related single-machine with two-agent scheduling problem
- Two-agent single-machine scheduling with assignable due dates
- Multiagent scheduling. Models and algorithms
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
Cited in
(10)- A survey of due-date related single-machine with two-agent scheduling problem
- Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times
- Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
- CON/SLK due date assignment and scheduling on a single machine with two agents
- Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
- Competitive two-agent scheduling with release dates and preemption on a single machine
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines
- Minmax common due-window assignment scheduling with deteriorating jobs
- Two-agent single-scheduling problems of proportionally-linear deteriorated jobs with the maxi-and-total cost criteria
- Scheduling with assignable due dates, two competing agents and late work related criteria
This page was built for publication: Due date-related scheduling with two agents. Models and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2303121)
