{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T11:56:10Z","timestamp":1712404570957},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf02243393","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T21:19:02Z","timestamp":1132003142000},"page":"17-30","source":"Crossref","is-referenced-by-count":9,"title":["Scheduling two jobs with fixed and nonfixed routes"],"prefix":"10.1007","volume":"52","author":[{"given":"N. V.","family":"Shakhlevich","sequence":"first","affiliation":[]},{"given":"Yu. N.","family":"Sotskov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02243393_CR1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF02276919","volume":"40","author":"P. Brucker","year":"1988","unstructured":"Brucker, P.: An efficient algorithm for the job-shop problem with two jobs. Computing40, 353\u2013359 (1988).","journal-title":"Computing"},{"key":"BF02243393_CR2","volume-title":"Theory of scheduling","author":"R. W. Conway","year":"1967","unstructured":"Conway, R. W., Maxwell, W. L., Miller, L. W.: Theory of scheduling. Reading: Addison-Wesley 1967."},{"key":"BF02243393_CR3","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., Johnson, D. S.: Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman 1979."},{"key":"BF02243393_CR4","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzalez","year":"1976","unstructured":"Gonzalez, T., Sahni, S.: Open shop scheduling to minimize finish time. J. Assoc. Comput. Math.23, 665\u2013679 (1976).","journal-title":"J. Assoc. Comput. Math."},{"key":"BF02243393_CR5","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1287\/opre.11.6.889","volume":"11","author":"W. W. Hardgrave","year":"1963","unstructured":"Hardgrave, W. W., Nemhauser, G.: A geometric model and graphical algorithm for a sequencing problem. Oper. Res.11, 889\u2013900 (1963).","journal-title":"Oper. Res."},{"key":"BF02243393_CR6","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., Shmoys, D. B.: Sequencing and scheduling: algorithms and complexity. Report 8945\/A, Econometric Institute, Erasmus University Rotterdam, 1989."},{"key":"BF02243393_CR7","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J. K. Lenstra","year":"1977","unstructured":"Lenstra, J. K., Rinnooy Kan, A. H. G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discr. Math.1, 343\u2013362 (1977).","journal-title":"Ann. Discr. Math."},{"key":"BF02243393_CR8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0166-218X(85)80007-X","volume":"11","author":"T. Masuda","year":"1985","unstructured":"Masuda, T., Ishii, H., Nishida, T.: The mixed shop scheduling problem. Discr. Appl. Math.11, 175\u2013186 (1985).","journal-title":"Discr. Appl. Math."},{"key":"BF02243393_CR9","unstructured":"Shakhlevich, N. V., Strusevich, V. A.: Scheduling two jobs in a multi-machine open shop to minimize an arbitrary regular penalty function. Report 9125\/A, Econometric Institute, Erasmus University Rotterdam, 1990."},{"key":"BF02243393_CR10","first-page":"86","volume-title":"Automatization of design processes","author":"Yu. N. Sotskov","year":"1985","unstructured":"Sotskov, Yu. N.: The optimal processing of two jobs under a regular criterion. In: Automatization of design processes (Automatizacia Processov Proektirovania), pp. 86\u201395. Minsk: Institute of Engineering Cybernetics, 1985 (in Russian)."},{"key":"BF02243393_CR11","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/0377-2217(91)90066-5","volume":"53","author":"Yu. N. Sotskov","year":"1991","unstructured":"Sotskov, Yu. N.: The complexity of shop-scheduling problems with two or three jobs. Eur. J. Oper. Res.53, 326\u2013336 (1991).","journal-title":"Eur. J. Oper. Res."},{"key":"BF02243393_CR12","first-page":"96","volume":"4","author":"Yu. N. Sotskov","year":"1990","unstructured":"Sotskov, Yu. N., Shakhlevich, N. V.: NP-hardness of optimal scheduling three jobs. Izvestia Akademii Nauk BSSR, Seria Fiziko-Matematicheskikh Nauk4, 96\u2013101 (1990) (in Russian).","journal-title":"Izvestia Akademii Nauk BSSR, Seria Fiziko-Matematicheskikh Nauk"},{"key":"BF02243393_CR13","first-page":"88","volume":"3","author":"V. A. Strusevich","year":"1989","unstructured":"Strusevich, V. A.: On nonhomogeneous two-stage deterministic scheduling systems. Kibernetika (Kiev)3, 88\u201394 (1989) (in Russian).","journal-title":"Kibernetika (Kiev)"},{"key":"BF02243393_CR14","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1057\/jors.1991.96","volume":"42","author":"V. A. Strusevich","year":"1991","unstructured":"Strusevich, V. A.: Two machine super-shop scheduling problem. J. Opl. Res. Soc.42, 479\u2013492 (1991).","journal-title":"J. Opl. Res. Soc."},{"key":"BF02243393_CR15","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1287\/opre.8.6.782","volume":"8","author":"W. Szwarc","year":"1960","unstructured":"Szwarc, W.: Solution of the Akers-Friedman scheduling problem. Oper. Res.8, 782\u2013788 (1960).","journal-title":"Oper. Res."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02243393.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02243393\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02243393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T23:27:40Z","timestamp":1557876460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02243393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF02243393"],"URL":"https:\/\/doi.org\/10.1007\/bf02243393","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}