{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:32Z","timestamp":1759847792567},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,9,25]],"date-time":"2009-09-25T00:00:00Z","timestamp":1253836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s10951-009-0128-6","type":"journal-article","created":{"date-parts":[[2009,9,25]],"date-time":"2009-09-25T12:09:56Z","timestamp":1253880596000},"page":"3-11","source":"Crossref","is-referenced-by-count":7,"title":["Open-shop dense schedules: properties and worst-case performance ratio"],"prefix":"10.1007","volume":"15","author":[{"given":"Rongjun","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanzhen","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongxian","family":"Men","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guochun","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,25]]},"reference":[{"issue":"3","key":"128_CR1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/nav.3220360305","volume":"36","author":"I. Adiri","year":"1989","unstructured":"Adiri, I., & Aizikowitz, N. (1989). Open-shop scheduling problems with dominated machines. Naval Research Logistics, 36(3), 273\u2013281.","journal-title":"Naval Research Logistics"},{"issue":"3","key":"128_CR2","first-page":"177","volume":"15","author":"I. Barany","year":"1982","unstructured":"Barany, I., & Fiala, T. (1982). Nearly optimum solution of multimachine scheduling problems (in Hungarian). Szigma, 15(3), 177\u2013191.","journal-title":"Szigma"},{"key":"128_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0166-218X(96)00116-3","volume":"76","author":"P. Brucker","year":"1997","unstructured":"Brucker, P., Hurink, J., Jurisch, B., & Wostmann, B. (1997). A branch & bound algorithm for the open-shop problem. Discrete Applied Mathematics, 76, 43\u201359.","journal-title":"Discrete Applied Mathematics"},{"key":"128_CR4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/ijoc.5.3.321","volume":"5","author":"B. Chen","year":"1993","unstructured":"Chen, B., & Strusevich, V. A. (1993). Approximation algorithms for three machine open shop scheduling. ORSA Journal on Computing, 5, 321\u2013328.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"128_CR5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02669692","volume":"17","author":"B. Chen","year":"2001","unstructured":"Chen, B., & Yu, W. (2001). How good is a Dense Shop Schedule? Acta Mathematics Application Sinica, 17(1), 121\u2013128.","journal-title":"Acta Mathematics Application Sinica"},{"key":"128_CR6","unstructured":"Chen, R. (2003). Open shop scheduling problems and their dense schedules. Ph.D. Thesis, East China University of Science and Technology."},{"issue":"5","key":"128_CR7","first-page":"522","volume":"29","author":"R. Chen","year":"2003","unstructured":"Chen, R., & Yu, W. (2003). Analysis of operation chain\u2019s properties of dense schedules for open-shop. Journal of East China University of Science and Technology, 29(5), 522\u2013526.","journal-title":"Journal of East China University of Science and Technology"},{"issue":"6","key":"128_CR8","first-page":"670","volume":"26","author":"X. Chen","year":"2000","unstructured":"Chen, X., & Yu, W. (2000). Upper-bound of performance ratio of dense schedules for open-shop (in Chinese). Journal of East China University of Science and Technology, 26(6), 670\u2013673.","journal-title":"Journal of East China University of Science and Technology"},{"key":"128_CR9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/jos.73","volume":"4","author":"U. Dorndorf","year":"2001","unstructured":"Dorndorf, U., Pesch, E., & Phan-Huy, T. (2001). Solving the open shop scheduling problem. Journal of Scheduling, 4, 157\u2013174.","journal-title":"Journal of Scheduling"},{"key":"128_CR10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1023\/A:1018982630730","volume":"92","author":"I. G. Drobouchevich","year":"1999","unstructured":"Drobouchevich, I. G., & Strusevich, V. A. (1999). A polynomial algorithm for the three-machine open shop with a bottleneck machine. Annals of Operations Research, 92, 185\u2013210.","journal-title":"Annals of Operations Research"},{"key":"128_CR11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0377-2217(99)00356-2","volume":"128","author":"I. G. Drobouchevich","year":"2001","unstructured":"Drobouchevich, I. G., & Strusevich, V. A. (2001). Two-stage open shop scheduling with a bottleneck machine. EJOR, 128, 159\u2013174.","journal-title":"EJOR"},{"issue":"1","key":"128_CR12","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/moor.8.1.100","volume":"8","author":"T. Fiala","year":"1983","unstructured":"Fiala, T. (1983). An algorithm for the open-shop problem. Mathematics of Operations Research, 8(1), 100\u2013109.","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"128_CR13","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzalez","year":"1976","unstructured":"Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of the Association for Computing Machinery, 23(4), 665\u2013679.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"128_CR14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1018986731638","volume":"92","author":"A. Kononov","year":"1999","unstructured":"Kononov, A., Sevastianov, S., & Tchermykh, I. (1999). When difference in machine loads leads to efficient scheduling in open shops. Annals of Operations Research, 92, 211\u2013239.","journal-title":"Annals of Operations Research"},{"issue":"6","key":"128_CR15","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1007\/BF01291296","volume":"28","author":"S. V. Sevastianov","year":"1992","unstructured":"Sevastianov, S. V. (1992). A polynomial-time open-shop problem with an arbitrary number of machines. Cybernetics and Systems Analysis, 28(6), 918\u2013933.","journal-title":"Cybernetics and Systems Analysis"},{"key":"128_CR16","first-page":"191","volume":"82","author":"S. V. Sevastianov","year":"1998","unstructured":"Sevastianov, S. V., & Woeginger, G. J. (1998). Makespan minimization in open shops: a polynomial time approximation scheme. Mathematical Programming, 82, 191\u2013198.","journal-title":"Mathematical Programming"},{"key":"128_CR17","first-page":"58","volume":"2","author":"G. P. Volchkova","year":"2004","unstructured":"Volchkova, G. P. (2004). On a conjecture on dense open-shop schedules (in Russian). Vestnik Belorusskogo Gosudarstvennogo Universiteta, Seria 1, Fizika, Matematika, Informatika, 2, 58\u201361.","journal-title":"Vestnik Belorusskogo Gosudarstvennogo Universiteta, Seria 1, Fizika, Matematika, Informatika"},{"issue":"2","key":"128_CR18","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1287\/opre.45.2.288","volume":"45","author":"D. P. Williamson","year":"1997","unstructured":"Williamson, D. P., Hall, L. A., Hoogeveen, J. A., Hurkens, C. A. J., Lenstra, J. K., Sevastianov, S. V. et al. (1997). Short shop schedules. Operations Research, 45(2), 288\u2013294.","journal-title":"Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0128-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0128-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0128-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:43Z","timestamp":1559468383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0128-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,25]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["128"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0128-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,25]]}}}