{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T10:33:33Z","timestamp":1721212413790},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Methods of Operations Research"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1007\/bf01680374","type":"journal-article","created":{"date-parts":[[2006,7,7]],"date-time":"2006-07-07T22:15:02Z","timestamp":1152310502000},"page":"233-238","source":"Crossref","is-referenced-by-count":8,"title":["Optimal makespan schedule for three jobs on two machines"],"prefix":"10.1007","volume":"43","author":[{"given":"Svetlana A.","family":"Kravchenko","sequence":"first","affiliation":[]},{"given":"Yuri N.","family":"Sotskov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01680374_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF02276919","volume":"40","author":"P Brucker","year":"1988","unstructured":"Brucker P (1988) An efficient algorithm for the job-shop problem with two jobs. Computing 40:353\u2013359","journal-title":"Computing"},{"key":"BF01680374_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01719698","volume":"16","author":"P Brucker","year":"1994","unstructured":"Brucker P (1994) A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs. OR Spektrum 16:5\u20137","journal-title":"OR Spektrum"},{"key":"BF01680374_CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"key":"BF01680374_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/nav.3800030307","volume":"3","author":"IR Jackson","year":"1956","unstructured":"Jackson IR (1956) An extension of Johnson's results on job lot scheduling. Nav Res Log Quart 3:201\u2013203","journal-title":"Nav Res Log Quart"},{"key":"BF01680374_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discr Math 1:343\u2013362","journal-title":"Ann Discr Math"},{"key":"BF01680374_CR6","unstructured":"Sotskov YuN (1985) Optimal scheduling two jobs with regular criterion. Design Process Automating, Institute of Engineering Cybernetics, 86\u201395 (in Russian)"},{"key":"BF01680374_CR7","first-page":"96","volume":"4","author":"YuN Sotskov","year":"1990","unstructured":"Sotskov YuN, Shakhlevich NV (1990) NP-hardness of the problems of optimal scheduling three jobs. Vesti Akad Navuk BSSR Ser Fiz-Mat Navuk 4:96\u2013101 (in Russian)","journal-title":"Vesti Akad Navuk BSSR Ser Fiz-Mat Navuk"},{"key":"BF01680374_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0166-218X(93)E0169-Y","volume":"59","author":"YuN Sotskov","year":"1995","unstructured":"Sotskov YuN, Shakhlevich NV (1995) NP-hardness of shop-scheduling problems with three jobs. Discrete Appl Math 59:237\u2013266","journal-title":"Discrete Appl Math"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01680374.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF01680374\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01680374","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01680374.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T22:04:20Z","timestamp":1652565860000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF01680374"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["BF01680374"],"URL":"https:\/\/doi.org\/10.1007\/bf01680374","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}