Job Shop Scheduling with Unit Processing Times

Nikhil Bansal,Tracy Kimbrel,Maxim Sviridenko

MATHEMATICS OF OPERATIONS RESEARCH（2006）

引用 27|浏览0

暂无评分

摘要

We consider randomized algorithms for the preemptive job shop problem, or equivalently, the case in which all operations have unit length. We give an α-approximation for the case of two machines where α O(log m/log log m) for an arbitrary number m of machines, and the first (2+ε)-approximation for a constant number of machines. The first result is via an approximation algorithm for a string matching problem which is of independent interest.

查看译文

关键词

unit processing time,randomized algorithm,preemptive job shop problem,log log m,job shop scheduling,independent interest,constant number,approximation algorithm,unit length,log m,arbitrary number m,string matching

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要