A Lagrangian approach to single-machine scheduling problems with two competing agents
From MaRDI portal
Publication:2268518
DOI10.1007/s10951-008-0098-0zbMath1185.90063MaRDI QIDQ2268518
Alessandro Agnetis, Dario Pacciarelli, Gianluca De Pascale
Publication date: 8 March 2010
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-008-0098-0
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
Related Items
Single machine batch scheduling with two competing agents to minimize total flowtime, Two-agent single-machine scheduling problems under increasing linear deterioration, A two-machine flowshop problem with two agents, Scheduling problems with two competing agents to minimize minmax and minsum earliness measures, Solving a two-agent single-machine scheduling problem considering learning effect, Approximation schemes for two-machine flow shop scheduling with two agents, Unbounded parallel-batching scheduling with two competitive agents, SOME NONSTANDARD FEATURES OF BARGAINING PROBLEMS, SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN
Cites Work
- An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time.
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- A competitive scheduling problem and its relevance to UMTS channel assignment
- Scheduling Problems with Two Competing Agents
- Minimizing Weighted Completion Times with Deadlines
