Minimizing Makespan in No-Wait Job Shops
Lists
Only you see this
Abstract
In this paper, we study polynomial time approximation schemes (PTASes) for the no-wait job shop scheduling problem with the makespan objective function. It is known that the problem is MaxSNP-hard ...
BibTeX
@inproceedings{bansal2005minimizing,
author = {Nikhil Bansal and Mohammad Mahdian and Maxim Sviridenko},
title = {{Minimizing Makespan in No-Wait Job Shops}},
booktitle = {Math. Oper. Res},
year = {2005},
url = {https://openreview.net/forum?id=GA3QC_6-c9},
}Loading related content...