An approximate algorithm for a high-multiplicity parallel machine scheduling problem
From MaRDI portal
Publication:991471
DOI10.1016/J.ORL.2010.03.009zbMATH Open1193.90098OpenAlexW2009923570MaRDI QIDQ991471FDOQ991471
Authors: Carlo Filippi 
Publication date: 7 September 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2010.03.009
Recommendations
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
- Minimizing total weighted completion time approximately for the parallel machine problem with a single server
- Parallel machine scheduling with high multiplicity
- Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming
Cites Work
- Title not available (Why is that?)
- Convex quadratic and semidefinite programming relaxations in scheduling
- On Scheduling Independent Tasks with Restricted Execution Times
- Parallel machine scheduling with splitting jobs
- A polynomial algorithm for multiprocessor scheduling with two job lengths.
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Scheduling Jobs on Several Machines with the Job Splitting Property
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling
- Multiplicity and complexity issues in contemporary production scheduling
- Parallel machine scheduling with high multiplicity
- Probabilistic analysis of the minimum weighted flowtime scheduling problem
- Parallel machine scheduling, linear programming, and parameter list scheduling heuristics
Cited In (4)
- A parallel approximation scheme for the multiprocessor scheduling problem
- Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
This page was built for publication: An approximate algorithm for a high-multiplicity parallel machine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991471)
