Pages that link to "Item:Q5058765"
From MaRDI portal
The following pages link to Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop (Q5058765):
Displayed 5 items.
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Two competitive agents to minimize the weighted total late work and the total completion time (Q2243272) (← links)
- Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint (Q5058932) (← links)
- Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect (Q5059196) (← links)
- Multitasking scheduling problems with two competitive agents (Q5059462) (← links)