2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
From MaRDI portal
Publication:2102848
Recommendations
- Robust absolute single machine makespan scheduling-location problem on trees
- Solving scheduling and location problems in the plane simultaneously
- Approximation algorithm for minimizing total latency in machine scheduling with deliveries
- An absolute approximation algorithm for scheduling unrelated machines
- scientific article; zbMATH DE number 2242479
Cites work
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- scientific article; zbMATH DE number 2242479 (Why is no real title available?)
- Algorithms for the robust 1-center problem on a tree
- Approximation algorithms for NP-hard problems.
- Integrated scheduling and location models: single machine makespan problems
- Robust absolute single machine makespan scheduling-location problem on trees
- Robust optimization
- Robust single machine makespan scheduling with release date uncertainty
- Scheduling
- Scheduling algorithms
- Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
- Some simple scheduling algorithms
- Theory and applications of robust optimization
This page was built for publication: 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102848)