{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:24:44Z","timestamp":1742970284388,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642104299"},{"type":"electronic","value":"9783642104305"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-10430-5_71","type":"book-chapter","created":{"date-parts":[[2010,3,17]],"date-time":"2010-03-17T20:19:20Z","timestamp":1268857160000},"page":"917-926","source":"Crossref","is-referenced-by-count":2,"title":["An Ant Colony Optimization Model for Parallel Machine Scheduling with Human Resource Constraints"],"prefix":"10.1007","author":[{"given":"Zhu","family":"Qiong","sequence":"first","affiliation":[]},{"given":"Gu","family":"Yichao","sequence":"additional","affiliation":[]},{"given":"Zhang","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Zhang","family":"Jie","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Xuefang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"71_CR1","doi-asserted-by":"publisher","first-page":"9637","DOI":"10.1016\/j.eswa.2008.10.007","volume":"36","author":"J. Behnamian","year":"2009","unstructured":"Behnamian, J., Zandieh, M., Fatemi Ghomi, S.M.T.: Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm. Expert Systems with Applications\u00a036(6), 9637\u20139644 (2009)","journal-title":"Expert Systems with Applications"},{"issue":"6","key":"71_CR2","doi-asserted-by":"publisher","first-page":"2066","DOI":"10.1016\/j.cor.2008.07.003","volume":"36","author":"F. Chen","year":"2009","unstructured":"Chen, F., Song, K.: Minimizing makespan in two-stage hybrid cross docking scheduling problem. Computers & Operations Research\u00a036(6), 2066\u20132073 (2009)","journal-title":"Computers & Operations Research"},{"issue":"4","key":"71_CR3","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.autcon.2008.11.003","volume":"18","author":"P.H. Chen","year":"2009","unstructured":"Chen, P.H., Weng, H.: A two-phase GA model for resource-constrained project scheduling. Automation in Construction\u00a018(4), 485\u2013498 (2009)","journal-title":"Automation in Construction"},{"issue":"1-2","key":"71_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ijpe.2004.12.007","volume":"99","author":"T.D. Nait","year":"2006","unstructured":"Nait, T.D., et al.: A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times. International Journal of Production Economics\u00a099(1-2), 63\u201373 (2006)","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"71_CR5","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/S0377-2217(02)00265-5","volume":"142","author":"V. T\u2019kindt","year":"2002","unstructured":"T\u2019kindt, V., et al.: An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. European Journal of Operational Research\u00a0142(2), 250\u2013257 (2002)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"71_CR6","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.amc.2006.06.092","volume":"185","author":"M. Ziaee","year":"2007","unstructured":"Ziaee, M., Sadjadi, S.J.: Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling. Applied Mathematics and Computation\u00a0185(1), 218\u2013228 (2007)","journal-title":"Applied Mathematics and Computation"}],"container-title":["Advances in Intelligent and Soft Computing","Proceedings of the 6th CIRP-Sponsored International Conference on Digital Enterprise Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10430-5_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:29:23Z","timestamp":1714620563000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-10430-5_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642104299","9783642104305"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10430-5_71","relation":{},"ISSN":["1867-5662","1867-5670"],"issn-type":[{"type":"print","value":"1867-5662"},{"type":"electronic","value":"1867-5670"}],"subject":[],"published":{"date-parts":[[2010]]}}}