乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T19:12:38Z","timestamp":1724958758017},"reference-count":56,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1016\/j.cor.2023.106313","type":"journal-article","created":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T15:46:53Z","timestamp":1686930413000},"page":"106313","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["A three-phase matheuristic algorithm for the multi-day task assignment problem"],"prefix":"10.1016","volume":"159","author":[{"given":"Yang","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0009-0008-7423-3938","authenticated-orcid":false,"given":"Haichao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Haibo","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-3859-9229","authenticated-orcid":false,"given":"Abraham P.","family":"Punnen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.cor.2023.106313_b1","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1016\/j.cie.2010.07.010","article-title":"A note on task assignment of several problems","volume":"59","author":"Alidaee","year":"2010","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"10.1016\/j.cor.2023.106313_b2","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10288-011-0165-9","article-title":"LocalSolver 1.x: A black-box local-search solver for 0-1 programming","volume":"9","author":"Benoist","year":"2011","journal-title":"4OR"},{"issue":"11","key":"10.1016\/j.cor.2023.106313_b3","doi-asserted-by":"crossref","first-page":"3644","DOI":"10.1016\/j.cor.2007.04.003","article-title":"Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs","volume":"35","author":"Beraldi","year":"2008","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2023.106313_b4","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/j.ejor.2022.04.009","article-title":"A matheuristic for a customer assignment problem in direct marketing","volume":"304","author":"Bigler","year":"2023","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2023.106313_b5","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0377-2217(92)90077-M","article-title":"A survey of algorithms for the generalized assignment problem","volume":"60","author":"Cattrysse","year":"1992","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2023.106313_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.104933","article-title":"Lower and upper bounds for the non-linear generalized assignment problem","volume":"120","author":"D\u2019Ambrosio","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106313_b7","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"issue":"1","key":"10.1016\/j.cor.2023.106313_b8","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/S0377-2217(00)00108-9","article-title":"A tabu search heuristic for the generalized assignment problem","volume":"132","author":"Diaz","year":"2001","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2023.106313_b9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.cor.2016.09.012","article-title":"A quality and distance guided hybrid algorithm for the vertex separator problem","volume":"78","author":"Ding","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2023.106313_b10","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/j.cor.2010.06.001","article-title":"Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms","volume":"38","author":"Edison","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106313_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108575","article-title":"Workers-constrained shutdown maintenance scheduling with skills flexibility: Models and solution algorithms","volume":"172","author":"Ertem","year":"2022","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.cor.2023.106313_b12","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10479-005-3970-8","article-title":"On a fix-and-relax framework for a class of project scheduling problems","volume":"140","author":"Escudero","year":"2005","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2023.106313_b13","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1287\/opre.51.6.922.24914","article-title":"A branch-and-price algorithm for the multiperiod single-sourcing problem","volume":"51","author":"Freling","year":"2003","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2023.106313_b14","series-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"Garey","year":"1990"},{"key":"10.1016\/j.cor.2023.106313_b15","unstructured":"Gavish, B., Pirkul, H., 1982. Allocation of Databases and Processors in a Distributed Computing System. In: Management of Distributed Data Processing. North-Holland, pp. 215\u2013231."},{"issue":"6","key":"10.1016\/j.cor.2023.106313_b16","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1287\/mnsc.37.6.695","article-title":"Algorithms for the multi-resource generalized assignment problem","volume":"37","author":"Gavish","year":"1991","journal-title":"Manage. Sci."},{"issue":"11","key":"10.1016\/j.cor.2023.106313_b17","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1287\/mnsc.16.11.652","article-title":"Elements of large-scale mathematical programming part I: Concepts","volume":"16","author":"Geoffrion","year":"1970","journal-title":"Manage. Sci."},{"issue":"11","key":"10.1016\/j.cor.2023.106313_b18","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1287\/mnsc.16.11.676","article-title":"Elements of large scale mathematical programming part II: Synthesis of algorithms and bibliography","volume":"16","author":"Geoffrion","year":"1970","journal-title":"Manage. Sci."},{"issue":"4","key":"10.1016\/j.cor.2023.106313_b19","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1287\/inte.8.4.16","article-title":"Improved computer-based planning techniques, part 1","volume":"8","author":"Glover","year":"1978","journal-title":"Interfaces"},{"issue":"3","key":"10.1016\/j.cor.2023.106313_b20","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10288-018-0389-z","article-title":"Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem","volume":"17","author":"Haddadi","year":"2019","journal-title":"4OR"},{"key":"10.1016\/j.cor.2023.106313_b21","series-title":"2021 IEEE 25th International Conference on Intelligent Engineering Systems","first-page":"000145","article-title":"Kernel search for the generalized assignment problem","author":"J\u00e1no\u0161\u00edkov\u00e1","year":"2021"},{"issue":"2","key":"10.1016\/j.cor.2023.106313_b22","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1080\/00207543.2010.538745","article-title":"The multi-resource agent bottleneck generalised assignment problem","volume":"50","author":"Karsu","year":"2012","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2023.106313_b23","series-title":"2010 10th International Conference on Intelligent Systems Design and Applications","first-page":"1487","article-title":"Hyper-heuristic approaches for the dynamic generalized assignment problem","author":"Kiraz","year":"2010"},{"key":"10.1016\/j.cor.2023.106313_b24","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1018933012422","article-title":"DGAP - The dynamic generalized assignment problem","volume":"69","author":"Kogan","year":"1997","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2023.106313_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2021.102565","article-title":"Assigning and sequencing storage locations under a two level storage policy: Optimization model and matheuristic approaches","volume":"108","author":"Lanza","year":"2022","journal-title":"Omega"},{"key":"10.1016\/j.cor.2023.106313_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.106047","article-title":"Online generalized assignment problem with historical information","volume":"149","author":"Liu","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106313_b27","series-title":"Handbook of Metaheuristics","first-page":"129","article-title":"Iterated local search: Framework and applications","author":"Louren\u00e7o","year":"2019"},{"key":"10.1016\/j.cor.2023.106313_b28","series-title":"Matheuristics: Algorithms and Implementations","first-page":"3","article-title":"The generalized assignment problem","author":"Maniezzo","year":"2021"},{"key":"10.1016\/j.cor.2023.106313_b29","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"issue":"5","key":"10.1016\/j.cor.2023.106313_b30","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10732-010-9144-0","article-title":"GRASP with path-relinking for the generalized quadratic assignment problem","volume":"17","author":"Mateus","year":"2011","journal-title":"J. Heuristics"},{"issue":"1","key":"10.1016\/j.cor.2023.106313_b31","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-188X(88)90053-5","article-title":"Bottleneck generalized assignment problems","volume":"14","author":"Mazzola","year":"1988","journal-title":"Eng. Costs Prod. Econ."},{"issue":"6","key":"10.1016\/j.cor.2023.106313_b32","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1002\/nav.1029","article-title":"Heuristics for the multi-resource generalized assignment problem","volume":"48","author":"Mazzola","year":"2001","journal-title":"Nav. Res. Logist."},{"issue":"4","key":"10.1016\/j.cor.2023.106313_b33","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.disopt.2009.04.004","article-title":"Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem","volume":"6","author":"Mitrovi\u0107-Mini\u0107","year":"2009","journal-title":"Discrete Optim."},{"key":"10.1016\/j.cor.2023.106313_b34","series-title":"Handbook of Combinatorial Optimization: Supplement Volume B","first-page":"259","article-title":"The generalized assignment problem and extensions","author":"Morales","year":"2005"},{"issue":"24","key":"10.1016\/j.cor.2023.106313_b35","doi-asserted-by":"crossref","first-page":"7509","DOI":"10.1080\/00207543.2017.1378828","article-title":"Productivity improvement through a sequencing generalised assignment in an assembly line system","volume":"55","author":"Moussavi","year":"2017","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2023.106313_b36","series-title":"A Private Fleet Model with Multi-Stop Backhaul","author":"Murphy","year":"1986"},{"key":"10.1016\/j.cor.2023.106313_b37","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.dam.2019.08.015","article-title":"A new extended formulation of the generalized assignment problem and some associated valid inequalities","volume":"271","author":"Murthy","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.cor.2023.106313_b38","series-title":"Project file of the multi-day task assignment problem","author":"NWPU-ORMS","year":"2022"},{"issue":"3","key":"10.1016\/j.cor.2023.106313_b39","first-page":"123","article-title":"A survey of the generalized assignment problem and its applications","volume":"45","author":"\u00d6ncan","year":"2007","journal-title":"INFOR Inf. Syst. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2023.106313_b40","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.cor.2019.07.001","article-title":"Assignment problem with conflicts","volume":"111","author":"\u00d6ncan","year":"2019","journal-title":"Comput. Oper. Res."},{"issue":"12-part-2","key":"10.1016\/j.cor.2023.106313_b41","doi-asserted-by":"crossref","first-page":"S271","DOI":"10.1287\/mnsc.44.12.S271","article-title":"A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem","volume":"44","author":"Park","year":"1998","journal-title":"Manage. Sci."},{"issue":"3","key":"10.1016\/j.cor.2023.106313_b42","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s10589-011-9432-0","article-title":"An exact method with variable fixing for solving the generalized assignment problem","volume":"52","author":"Posta","year":"2012","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"10.1016\/j.cor.2023.106313_b43","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.ejor.2014.12.005","article-title":"Decomposition based hybrid metaheuristics","volume":"244","author":"Raidl","year":"2015","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2023.106313_b44","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01580430","article-title":"A branch and bound algorithm for the generalized assignment problem","volume":"8","author":"Ross","year":"1975","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.cor.2023.106313_b45","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1287\/ijoc.2018.0822","article-title":"Primal heuristics for branch and price: The assets of diving methods","volume":"31","author":"Sadykov","year":"2019","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2023.106313_b46","unstructured":"Sadykov, R., Vanderbeck, F., Pessoa, A., Uchoa, E., 2015. Column Generation Based Heuristic for the Generalized Assignment Problem. In: XLVII Simp\u00f3sio Brasileiro de Pesquisa Operacional. Porto de Galinhas, Brazil, pp. 3624\u20133631."},{"issue":"6","key":"10.1016\/j.cor.2023.106313_b47","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/opre.45.6.831","article-title":"A branch-and-price algorithm for the generalized assignment problem","volume":"45","author":"Savelsbergh","year":"1997","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2023.106313_b48","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1016\/j.eswa.2015.10.009","article-title":"Improved differential evolution algorithms for solving generalized assignment problem","volume":"45","author":"Sethanan","year":"2016","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10.1016\/j.cor.2023.106313_b49","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0377-2217(97)00035-0","article-title":"Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP)","volume":"105","author":"Shtub","year":"1998","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2023.106313_b50","first-page":"13","article-title":"A simple and efficient technique to generate bounded solutions for the generalized assignment problem: A guide for OR practitioners","author":"Vasko","year":"2022","journal-title":"Res. Rep. Inf. Sci."},{"issue":"18","key":"10.1016\/j.cor.2023.106313_b51","doi-asserted-by":"crossref","first-page":"5477","DOI":"10.1080\/00207543.2020.1783009","article-title":"The multi-skilled multi-period workforce assignment problem","volume":"59","author":"Wang","year":"2021","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"10.1016\/j.cor.2023.106313_b52","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/s10732-011-9164-4","article-title":"Backbone guided tabu search for solving the UBQP problem","volume":"19","author":"Wang","year":"2013","journal-title":"J. Heuristics"},{"issue":"2","key":"10.1016\/j.cor.2023.106313_b53","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.ejor.2008.11.036","article-title":"An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem","volume":"199","author":"Wilbaut","year":"2009","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2023.106313_b54","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1016\/j.ejor.2010.05.007","article-title":"A hybrid tabu search\/branch & bound approach to solving the generalized assignment problem","volume":"207","author":"Woodcock","year":"2010","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2023.106313_b55","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2018.11.012","article-title":"A matheuristic for a telecommunication network design problem with traffic grooming","volume":"90","author":"Wu","year":"2020","journal-title":"Omega"},{"issue":"2","key":"10.1016\/j.cor.2023.106313_b56","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/j.ejor.2004.08.015","article-title":"A path relinking approach with ejection chains for the generalized assignment problem","volume":"169","author":"Yagiura","year":"2006","journal-title":"European J. Oper. Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054823001776?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054823001776?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T16:09:16Z","timestamp":1697126956000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054823001776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11]]},"references-count":56,"alternative-id":["S0305054823001776"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2023.106313","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2023,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A three-phase matheuristic algorithm for the multi-day task assignment problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2023.106313","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"106313"}}