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