Pages that link to "Item:Q1671716"

The following pages link to A lower bound for minimizing the total completion time of a three-agent scheduling problem (Q1671716):

Displaying 2 items.

• Two-agent parallel-machine scheduling with rejection (Q1676363) (← links)
• Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design (Q2327696) (← links)