Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms
From MaRDI portal
Publication:622140
DOI10.1016/J.COR.2010.10.006zbMath1205.90135OpenAlexW1966886257MaRDI QIDQ622140
Publication date: 31 January 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.10.006
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- Approximation algorithms for combinatorial problems
- NP-hardness of shop-scheduling problems with three jobs
- A threshold of ln n for approximating set cover
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Computational Complexity of Discrete Optimization Problems
- On the hardness of approximating minimization problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms