Pages that link to "Item:Q1671716"
From MaRDI portal
The following pages link to A lower bound for minimizing the total completion time of a three-agent scheduling problem (Q1671716):
Displaying 4 items.
- A scheduling problem with three competing agents (Q337134) (← links)
- Two-agent parallel-machine scheduling with rejection (Q1676363) (← links)
- Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design (Q2327696) (← links)
- A three-agent scheduling problem for minimizing the flow time on two machines (Q5109775) (← links)