Flowshop and Jobshop Schedules: Complexity and Approximation Export

@article{citeulike:4881264, abstract = {We show that finding minimum finish time preemptive and non-preemptive schedules for flow shops and job shops is NP-complete. Bounds on the performance of various heuristics to generate reasonably good schedules are also obtained. 10.1287/opre.26.1.36}, author = {Gonzalez, Teofilo and Sahni, Sartaj}, citeulike-article-id = {4881264}, citeulike-linkout-0 = {http://dx.doi.org/10.1287/opre.26.1.36}, citeulike-linkout-1 = {http://or.journal.informs.org/cgi/content/abstract/26/1/36}, day = {1}, doi = {10.1287/opre.26.1.36}, journal = {OPERATIONS RESEARCH}, keywords = {jobshop, phd, publi1}, month = {January}, number = {1}, pages = {36--52}, posted-at = {2009-06-17 15:29:01}, priority = {2}, title = {Flowshop and Jobshop Schedules: Complexity and Approximation}, url = {http://dx.doi.org/10.1287/opre.26.1.36}, volume = {26}, year = {1978} }

TY - JOUR ID - citeulike:4881264 L3 - citeulike-article-id:4881264 N2 - We show that finding minimum finish time preemptive and non-preemptive schedules for flow shops and job shops is NP-complete. Bounds on the performance of various heuristics to generate reasonably good schedules are also obtained. 10.1287/opre.26.1.36 IS - 1 JF - OPERATIONS RESEARCH EP - 52 TI - Flowshop and Jobshop Schedules: Complexity and Approximation VL - 26 SP - 36 KW - jobshop KW - phd KW - publi1 AU - Gonzalez, Teofilo AU - Sahni, Sartaj PY - 1978/01/01/ UR - http://dx.doi.org/10.1287/opre.26.1.36 ER -