{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:21:25Z","timestamp":1761488485964},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283201"},{"type":"electronic","value":"9783540318637"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539902_31","type":"book-chapter","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T21:50:31Z","timestamp":1279662631000},"page":"259-268","source":"Crossref","is-referenced-by-count":7,"title":["Hybrid Genetic Algorithm for the Flexible Job-Shop Problem Under Maintenance Constraints"],"prefix":"10.1007","author":[{"given":"Nozha","family":"Zribi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Borne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Adiri, I., Bruno, J., Frostig, E., Rinnooy Kan, A.H.G.: Single machine flow-time with a single breakdown. Acta Informatica 26, 679\u2013696","DOI":"10.1007\/BF00288977"},{"key":"31_CR2","unstructured":"Aggoune, R.: Ordonnancement d\u2019Ateliers sous Contraintes de Disponibilit\u00e9 des Machines, Ph.D. Thesis, Universit\u00e9 de Metz, France (2002)"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/S0305-0483(01)00048-2","volume":"29","author":"J. Blazewicz","year":"2001","unstructured":"Blazewicz, J., Breit, J., Formanowicz, P., Kubiak, W., Schmidt, G.: Heuristic algorithms for the two-machine flowshop problem with limited machine availability. Omega Journal\u00a029, 599\u2013608 (2001)","journal-title":"Omega Journal"},{"key":"31_CR4","unstructured":"Jurisch, B.: Scheduling Jobs in Shops with Multi Purpose Machines. Ph.D Thesis, Universit\u00e4t Osnabr\u00fcck (1992)"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/S0377-2217(01)00083-2","volume":"136","author":"W. Kubiak","year":"2002","unstructured":"Kubiak, W., Blazewicz, J., Formanowicz, P., Breit, J., Schmidt, G.: Two-machine flow shops with limited machine availability. European Journal of Operational Research\u00a0136, 528\u2013540 (2002)","journal-title":"European Journal of Operational Research"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"C.Y. Lee","year":"1996","unstructured":"Lee, C.Y.: Machine scheduling with an availability constraint. Journal of Global Optimization\u00a09, 395\u2013416 (1996)","journal-title":"Journal of Global Optimization"},{"key":"31_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu search. Kluwer Publishers, Boston (1997)"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0167-6377(96)00041-7","volume":"20","author":"C.Y. Lee","year":"1997","unstructured":"Lee, C.Y.: Minimizing the mazkespan in two-machine flowshop scheduling with availability constraint. Operations research letters\u00a020, 129\u2013139 (1997)","journal-title":"Operations research letters"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/S0377-2217(97)00452-9","volume":"114","author":"C.Y. Lee","year":"1999","unstructured":"Lee, C.Y.: Two-machine flowshop scheduling with availability constraints. European Journal of Operational Research\u00a0114, 420\u2013429 (1999)","journal-title":"European Journal of Operational Research"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Lee, K.M., Yamakawa, T.: A Genetic algorithm for general machine scheduling problems. In: Int. Conf. on Conventional and knowledge-Based Electronics Systems, Australia, vol.\u00a02, pp. 60\u201366 (1998)","DOI":"10.1109\/KES.1998.725893"},{"issue":"6","key":"31_CR11","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A Fast Taboo Search Algorithm for the Job-Shop Problem. Management Science\u00a042(6), 797\u2013813 (1996)","journal-title":"Management Science"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01920917","volume":"A28","author":"G. Schmidt","year":"1984","unstructured":"Schmidt, G.: Scheduling on semi identical processors. Z. Oper. Res.\u00a0A28, 153\u2013162 (1984)","journal-title":"Z. Oper. Res."},{"key":"31_CR13","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1057\/jors.1988.44","volume":"39","author":"G. Schmidt","year":"1988","unstructured":"Schmidt, G.: Scheduling independent tasks with deadlines on semi-identical processors. Journal of Operational research society\u00a039, 271\u2013277 (1988)","journal-title":"Journal of Operational research society"},{"key":"31_CR14","unstructured":"Roy, B., Sussmann, B.: Les problemes d\u2019ordonnancement avec contraintes disjonctives (in French). Technical Report 9 bis, SEMA, Paris (France) (December 1964)"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/1520-6750(199202)39:1<53::AID-NAV3220390105>3.0.CO;2-C","volume":"39","author":"V.J. Leon","year":"1992","unstructured":"Leon, V.J., Wu, S.D.: On scheduling with ready-times, due-dates and vacations. Naval Research Logistics\u00a039, 53\u201365 (1992)","journal-title":"Naval Research Logistics"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"G. Schmidt","year":"2000","unstructured":"Schmidt, G.: Scheduling with limited machine availability. European Journal of Operational Research\u00a0121, 1\u201315 (2000)","journal-title":"European Journal of Operational Research"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Mauguiere, P., Billaut, J.-C., Bouquard, J.-L.: New single machine and job-shop scheduling problems with availability constraints. Journal of Scheduling (2004)","DOI":"10.1007\/s10951-005-6812-2"},{"key":"31_CR18","unstructured":"Zribi, N., Kacem, I., EL Kamel, A.: Hierarchical Optimization for the Flexible Job-shops Scheduling Problem. In: INCOM 2004, Brazil, April 5-7 (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539902_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:17:33Z","timestamp":1605644253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539902_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283201","9783540318637"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11539902_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}