Pages that link to "Item:Q976483"
From MaRDI portal
The following pages link to Scheduling problems with two competing agents to minimize minmax and minsum earliness measures (Q976483):
Displayed 7 items.
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
- Single machine batch scheduling with two competing agents to minimize total flowtime (Q420859) (← links)
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties (Q454994) (← links)
- Solving a two-agent single-machine scheduling problem considering learning effect (Q1762153) (← links)
- Unbounded parallel-batching scheduling with two competitive agents (Q2434303) (← links)
- Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
- SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN (Q3114615) (← links)