Pages that link to "Item:Q2268518"
From MaRDI portal
The following pages link to A Lagrangian approach to single-machine scheduling problems with two competing agents (Q2268518):
Displayed 9 items.
- Single machine batch scheduling with two competing agents to minimize total flowtime (Q420859) (← links)
- Two-agent single-machine scheduling problems under increasing linear deterioration (Q552491) (← links)
- A two-machine flowshop problem with two agents (Q709115) (← links)
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures (Q976483) (← links)
- Solving a two-agent single-machine scheduling problem considering learning effect (Q1762153) (← links)
- Approximation schemes for two-machine flow shop scheduling with two agents (Q1928514) (← links)
- Unbounded parallel-batching scheduling with two competitive agents (Q2434303) (← links)
- SOME NONSTANDARD FEATURES OF BARGAINING PROBLEMS (Q2854006) (← links)
- SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN (Q3114615) (← links)