乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:11:27Z","timestamp":1725675087840},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642293528"},{"type":"electronic","value":"9783642293535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29353-5_15","type":"book-chapter","created":{"date-parts":[[2012,4,14]],"date-time":"2012-04-14T12:14:18Z","timestamp":1334405658000},"page":"128-135","source":"Crossref","is-referenced-by-count":1,"title":["A Variable Iterated Greedy Algorithm with Differential Evolution for Solving No-Idle Flowshops"],"prefix":"10.1007","author":[{"given":"M. Fatih","family":"Tasgetiren","sequence":"first","affiliation":[]},{"given":"Quan-Ke","family":"Pan","sequence":"additional","affiliation":[]},{"given":"P. N.","family":"Suganthan","sequence":"additional","affiliation":[]},{"given":"Ozge","family":"Buyukdagli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/S0360-8352(02)00217-6","volume":"44","author":"N.E.H. Saadani","year":"2003","unstructured":"Saadani, N.E.H., Guinet, A., Moalla, M.: Three stage no-idle flow-shops. Computers & Industrial Engineering\u00a044(3), 425\u2013434 (2003)","journal-title":"Computers & Industrial Engineering"},{"key":"15_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-1190-4","volume-title":"Scheduling Theory. Multi-Stage Systems","author":"V.S. Tanaev","year":"1994","unstructured":"Tanaev, V.S., Sotskov, Y.N., Strusevich, V.A.: Scheduling Theory. Multi-Stage Systems. Kluwer Academic Publishers, Dordrecht (1994)"},{"key":"15_CR3","unstructured":"Baptiste, P., Hguny, L.K.: A branch and bound algorithm for the F\/no\u2212idle\/Cmax. In: Proceedings of the International Conference on Industrial Engineering and Production Management, IEPM 1997, Lyon, France, pp. 429\u2013438 (1997)"},{"issue":"3","key":"15_CR4","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/S0360-8352(02)00217-6","volume":"44","author":"N.E.H. Saadani","year":"2003","unstructured":"Saadani, N.E.H., Guinet, A., Moalla, M.: Three stage no-idle flow-shops. Computers & Industrial Engineering\u00a044(3), 425\u2013434 (2003)","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1016\/j.ejor.2006.11.025","volume":"184","author":"D. Baraz","year":"2008","unstructured":"Baraz, D., Mosheiov, G.: A note on a greedy heuristic for the flow-shop makespan minimization with no machine idle-time. European Journal of Operational Research\u00a0184(2), 810\u2013813 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1002\/nav.3800290311","volume":"29","author":"I. Adiri","year":"1982","unstructured":"Adiri, I., Pohoryles, D.: Flow-shop\/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics Quarterly\u00a029(3), 495\u2013504 (1982)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0360-8352(82)90004-3","volume":"6","author":"P. Vachajitpan","year":"1982","unstructured":"Vachajitpan, P.: Job sequencing with continuous machine operation. Computers and Industrial Engineering\u00a06(3), 255\u2013259 (1982)","journal-title":"Computers and Industrial Engineering"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0360-8352(86)90028-8","volume":"10","author":"C.R. Woollam","year":"1986","unstructured":"Woollam, C.R.: Flowshop with no idle machine time allowed. Computers and Industrial Engineering\u00a010(1), 69\u201376 (1986)","journal-title":"Computers and Industrial Engineering"},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1002\/(SICI)1520-6750(200006)47:4<353::AID-NAV5>3.0.CO;2-U","volume":"47","author":"O. Cepek","year":"2000","unstructured":"Cepek, O., Okada, M., Vlach, M.: Note: On the two-machine no-idle flowshop problem. Naval Research Logistics\u00a047(4), 353\u2013358 (2000)","journal-title":"Naval Research Logistics"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1017\/S1446181100010026","volume":"47","author":"L. Narain","year":"2005","unstructured":"Narain, L., Bagga, P.C.: Flowshop\/no-idle scheduling to minimise the mean flowtime. Anziam Journal\u00a047, 265\u2013275 (2005)","journal-title":"Anziam Journal"},{"key":"15_CR11","unstructured":"Saadani, N.E.H., Guinet, A., Moalla, M.: A traveling salesman approach to solve the F\/no \u2212 idle\/Cmax problem. In: Proceedings of the International Conference on Industrial Engineering and Production Management (IEPM 2001), Quebec, Canada, pp. 880\u2013888 (2001)"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.ejor.2003.08.030","volume":"161","author":"N.E.H. Saadani","year":"2005","unstructured":"Saadani, N.E.H., Guinet, A., Moalla, M.: A travelling salesman approach to solve the F\/no\u2212idle\/Cmax problem. European Journal of Operational Research\u00a0161(1), 11\u201320 (2005)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"15_CR13","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.cie.2004.01.008","volume":"46","author":"J. Kamburowski","year":"2004","unstructured":"Kamburowski, J.: More on three-machine no-idle flow shops. Computers and Industrial Engineering\u00a046(3), 461\u2013466 (2004)","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10898-004-1848-y","volume":"33","author":"L. Narain","year":"2005","unstructured":"Narain, L., Bagga, P.C.: Flowshop\/no-idle scheduling to minimize total elapsed time. Journal of Global Optimization\u00a033(3), 349\u2013367 (2005)","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.ejor.2006.01.036","volume":"178","author":"P.J. Kalczynski","year":"2007","unstructured":"Kalczynski, P.J., Kamburowski, J.: On no-wait and no-idle flow shops with makespan criterion. European Journal of Operational Research\u00a0178(3), 677\u2013685 (2007)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"15_CR16","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1504\/EJIE.2008.017687","volume":"2","author":"Q.-K. Pan","year":"2008","unstructured":"Pan, Q.-K., Wang, L.: A novel differential evolution algorithm for no-idle permutation flowshop scheduling problems. European Journal of Industrial Engineering\u00a02(3), 279\u2013297 (2008)","journal-title":"European Journal of Industrial Engineering"},{"issue":"7-8","key":"15_CR17","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1007\/s00170-007-1252-0","volume":"39","author":"Q.-K. Pan","year":"2008","unstructured":"Pan, Q.-K., Wang, L.: No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm. International Journal of Advanced Manufacturing Technology\u00a039(7-8), 796\u2013807 (2008)","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"15_CR18","series-title":"SCI","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-02836-6_2","volume-title":"Computational Intelligence in Flow Shop and Job Shop Scheduling","author":"R. Ruiz","year":"2009","unstructured":"Ruiz, R., Vallada, E., Fern\u00e1ndez-Mart\u00ednez, C.: Scheduling in Flowshops with No-Idle Machines. In: Chakraborty, U.K. (ed.) Computational Intelligence in Flow Shop and Job Shop Scheduling. SCI, vol.\u00a0230, pp. 21\u201351. Springer, Heidelberg (2009)"},{"key":"15_CR19","unstructured":"Tasgetiren, M.F., Pan, Q.-K., Suganthan, P.N., Chua, T.-J.: A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion. International Journal of Production Research, 1\u201318 (2010); iFirst"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R. Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential Evolution - A Simple and Efficient Heuristic for Global Optimization over Continuous Space. Journal of Global Optimization\u00a011, 341\u2013359 (1997)","journal-title":"Journal of Global Optimization"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Das, S., Suganthan, P.N.: Differential Evolution: A survey of the State-of-the-Art. IEEE Transaction on Evolutionary Computation (2011) (in press)","DOI":"10.1109\/TEVC.2010.2059031"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore Jr., E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. Omega\u00a011(1), 91\u201395 (1983)","journal-title":"Omega"},{"issue":"3","key":"15_CR23","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R. Ruiz","year":"2007","unstructured":"Ruiz, R., St\u00fctzle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research\u00a0177(3), 2033\u20132049 (2007)","journal-title":"European Journal of Operational Research"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Deng, G., Gu, X.: A hybrid discrete differential evolution algorithm for the no-idle permutation flowshop scheduling problem with makespan criterion. Computers & Operations Research (2011), doi:10.1016\/j.cor.2011.10.024","DOI":"10.1016\/j.cor.2011.10.024"}],"container-title":["Lecture Notes in Computer Science","Swarm and Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29353-5_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:36:51Z","timestamp":1620128211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29353-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293528","9783642293535"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29353-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}