Minimizing total completion time with machine-dependent priority lists
From MaRDI portal
Publication:6586213
DOI10.1016/J.EJOR.2023.12.030MaRDI QIDQ6586213
Tami Tamir, Vipin Ravindran Vijayalakshmi, Marc Schröder
Publication date: 13 August 2024
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The third comprehensive survey on scheduling problems with setup times/costs
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Coordination mechanisms for selfish scheduling
- Optimization, approximation, and complexity classes
- The hardness of approximation: Gap location
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Batch scheduling to minimize total completion time
- Fixed-order scheduling on parallel machines
- The price of anarchy for utilitarian scheduling games on related machines
- A survey of scheduling problems with setup times or costs
- Decentralized utilitarian mechanisms for scheduling games
- Non-approximability results for scheduling problems with minsum criteria
- Coordination mechanisms from (almost) all scheduling policies
- Convex quadratic and semidefinite programming relaxations in scheduling
- Complexity of Scheduling under Precedence Constraints
- Scheduling Unrelated Machines by Randomized Rounding
- Reducibility among Combinatorial Problems
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Scheduling games with machine-dependent priority lists
- Scheduling
- Congestion games with priority-based scheduling
- A note on max \(k\)-vertex cover: faster FPT-AS, smaller approximate kernel and improved approximation
This page was built for publication: Minimizing total completion time with machine-dependent priority lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586213)
