Pages that link to "Item:Q337134"
From MaRDI portal
The following pages link to A scheduling problem with three competing agents (Q337134):
Displaying 5 items.
- Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities (Q1639885) (← links)
- A lower bound for minimizing the total completion time of a three-agent scheduling problem (Q1671716) (← links)
- (Q4255366) (← links)
- A three-agent scheduling problem for minimizing the flow time on two machines (Q5109775) (← 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)