Pages that link to "Item:Q271931"
From MaRDI portal
The following pages link to Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931):
Displaying 8 items.
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment (Q829197) (← links)
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← links)
- A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar (Q1991211) (← links)
- Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
- Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (Q6057022) (← links)
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work (Q6076476) (← links)
- Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
