乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:48:15Z","timestamp":1648633695110},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s13675-017-0086-2","type":"journal-article","created":{"date-parts":[[2017,5,15]],"date-time":"2017-05-15T09:36:04Z","timestamp":1494840964000},"page":"29-54","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights"],"prefix":"10.1016","volume":"6","author":[{"given":"Anjulika","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Prabha","family":"Sharma","sequence":"additional","affiliation":[]},{"given":"Hemant","family":"Salwan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1-2","key":"10.1007\/s13675-017-0086-2_CR1","first-page":"25","article-title":"Batch scheduling of deteriorating products","volume":"1","author":"Barketau","year":"2007","journal-title":"Decis Mak Manuf Serv"},{"issue":"1","key":"10.1007\/s13675-017-0086-2_CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10951-007-0047-3","article-title":"Batch scheduling of step deteriorating jobs","volume":"11","author":"Barketau","year":"2008","journal-title":"J Sched"},{"key":"10.1007\/s13675-017-0086-2_CR3","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1137\/0122054","article-title":"Permutation polyhedra","volume":"22","author":"Bowman","year":"1972","journal-title":"SIAM J Appl Math"},{"key":"10.1007\/s13675-017-0086-2_CR4","doi-asserted-by":"crossref","first-page":"432","DOI":"10.2307\/1427168","article-title":"Dynamic priority rules for cyclic type queues","volume":"10","author":"Browne","year":"1989","journal-title":"Adv Appl Probab"},{"key":"10.1007\/s13675-017-0086-2_CR5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0132025","article-title":"Adjacent vertices on permutohedron","volume":"32","author":"Gaiha","year":"1990","journal-title":"SIAM J Appl Math"},{"key":"10.1007\/s13675-017-0086-2_CR6","series-title":"Time-dependent scheduling","author":"Gawiejnowicz","year":"2008"},{"key":"10.1007\/s13675-017-0086-2_CR7","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0360-8352(88)90041-1","article-title":"Single facility scheduling with nonlinear processing times","volume":"14","author":"Gupta","year":"1988","journal-title":"Comput Ind Eng"},{"issue":"4","key":"10.1007\/s13675-017-0086-2_CR8","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/j.cie.2011.05.025","article-title":"An efficient local search algorithm for minimizing mean absolute deviation of completion times from mean completion time on a single machine","volume":"61","author":"Gupta","year":"2011","journal-title":"Comput Ind Eng"},{"key":"10.1007\/s13675-017-0086-2_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0305-0483(87)90071-5","article-title":"Optimal repayment policies for multiple loans","volume":"15","author":"Gupta","year":"1987","journal-title":"OMEGA"},{"key":"10.1007\/s13675-017-0086-2_CR10","series-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1007\/s13675-017-0086-2_CR11","doi-asserted-by":"crossref","unstructured":"Kovalyov MY, Kubiak W (1998) A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. J Heuristics 3:287\u2013297","DOI":"10.1023\/A:1009626427432"},{"key":"10.1007\/s13675-017-0086-2_CR12","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1002\/(SICI)1520-6750(199808)45:5<511::AID-NAV5>3.0.CO;2-6","article-title":"Scheduling deteriorating jobs to minimize makespan","volume":"45","author":"Kubiak","year":"1998","journal-title":"Nav Res Logist"},{"issue":"47","key":"10.1007\/s13675-017-0086-2_CR13","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/0377-2217(90)90089-T","article-title":"Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem","volume":"1990","author":"Kunnathur","year":"1990","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-017-0086-2_CR14","unstructured":"Lawler EL (1976) Sequencing to minimize the weighted number of tardy jobs. Rev. Fr autom Inf Rech Oper Suppl. 10:27\u201333"},{"issue":"3","key":"10.1007\/s13675-017-0086-2_CR15","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1016\/j.ejor.2006.03.067","article-title":"Sum of completion times for batch scheduling of jobs with deteriorating processing times","volume":"187","author":"Leung","year":"2008","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-017-0086-2_CR16","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1287\/opre.39.6.979","article-title":"V-shaped policies for scheduling deteriorating jobs","volume":"39","author":"Mosheiov","year":"1990","journal-title":"Oper Res"},{"key":"10.1007\/s13675-017-0086-2_CR17","unstructured":"Sharma P (2002a) Permutation polyhedra and minimizing flow times of deteriorating jobs. Narosa publication house, India"},{"key":"10.1007\/s13675-017-0086-2_CR18","doi-asserted-by":"crossref","unstructured":"Sharma P (2002b) Permutation polyhedra and minimisation of the variance of completion times on a single machine. J Heuristics 8:467\u2013485","DOI":"10.1023\/A:1015496114938"},{"key":"10.1007\/s13675-017-0086-2_CR19","doi-asserted-by":"crossref","unstructured":"Yusriski R, Sukoyo, Samadhi TMAA, Halim AH (2016) An integer batch scheduling model for a single machine with simultaneous learning and deterioration effects to minimize total actual flow time. In: IOP conference series: materials science and engineering, vol 114","DOI":"10.1088\/1757-899X\/114\/1\/012073"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-017-0086-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-017-0086-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000940?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000940?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-017-0086-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:24:14Z","timestamp":1648632254000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["S2192440621000940"],"URL":"https:\/\/doi.org\/10.1007\/s13675-017-0086-2","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}