Tight Bounds for Permutation Flow Shop Scheduling

Viswanath Nagarajan, Maxim Sviridenko

Abstract

In flow shop scheduling there are m machines and n jobs, such that every job has to be processed on the machines in the fixed order 1,…,m. In the permutation flow shop problem, it is also required ...
BibTeX
@inproceedings{nagarajan2008tight,
  author = {Viswanath Nagarajan and Maxim Sviridenko},
  title = {{Tight Bounds for Permutation Flow Shop Scheduling}},
  booktitle = {IPCO},
  year = {2008},
  doi = {10.1007/978-3-540-68891-4\_11},
}

Loading related content...

Figure