[{"issue":"3","year":"2002","doi":"10.1007/s004930200018","type":"journal_article","publication":"Combinatorica","date_updated":"2019-01-03T13:12:50Z","user_id":"15504","title":"Improved Bounds for Acyclic Job Shop Scheduling","citation":{"bibtex":"@article{Feige_Scheideler_2002, title={Improved Bounds for Acyclic Job Shop Scheduling}, DOI={<a href=\"https://doi.org/10.1007/s004930200018\">10.1007/s004930200018</a>}, number={3}, journal={Combinatorica}, author={Feige, Uriel and Scheideler, Christian}, year={2002}, pages={361--399} }","chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” <i>Combinatorica</i>, no. 3 (2002): 361--399. <a href=\"https://doi.org/10.1007/s004930200018\">https://doi.org/10.1007/s004930200018</a>.","apa":"Feige, U., &#38; Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop Scheduling. <i>Combinatorica</i>, (3), 361--399. <a href=\"https://doi.org/10.1007/s004930200018\">https://doi.org/10.1007/s004930200018</a>","short":"U. Feige, C. Scheideler, Combinatorica (2002) 361--399.","ama":"Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling. <i>Combinatorica</i>. 2002;(3):361--399. doi:<a href=\"https://doi.org/10.1007/s004930200018\">10.1007/s004930200018</a>","mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” <i>Combinatorica</i>, no. 3, 2002, pp. 361--399, doi:<a href=\"https://doi.org/10.1007/s004930200018\">10.1007/s004930200018</a>.","ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,” <i>Combinatorica</i>, no. 3, pp. 361--399, 2002."},"_id":"2134","date_created":"2018-04-03T05:43:36Z","page":"361--399","author":[{"last_name":"Feige","full_name":"Feige, Uriel","first_name":"Uriel"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"status":"public","department":[{"_id":"79"}]}]