{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T19:32:27Z","timestamp":1771875147957,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642310195","type":"print"},{"value":"9783642310201","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31020-1_45","type":"book-chapter","created":{"date-parts":[[2012,6,12]],"date-time":"2012-06-12T16:59:14Z","timestamp":1339520354000},"page":"383-390","source":"Crossref","is-referenced-by-count":10,"title":["Discover Scheduling Strategies with Gene Expression Programming for Dynamic Flexible Job Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Li","family":"Nie","sequence":"first","affiliation":[]},{"given":"Yuewei","family":"Bai","sequence":"additional","affiliation":[]},{"given":"Xiaogang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"A. Jain","year":"1998","unstructured":"Jain, A., Meeran, S.: Deterministic job-shop scheduling: Past, present and future. Eur. J. Oper. Res.\u00a0113, 390\u2013434 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.ejor.2006.04.007","volume":"179","author":"N. Ho","year":"2007","unstructured":"Ho, N., Tay, J., Lai, E.: An effective architecture for learning and evolving flexible job-shop schedules. Eur. J. Oper. Res.\u00a0179, 316\u2013333 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s00170-005-0375-4","volume":"32","author":"M. Saidi-Mehrabad","year":"2007","unstructured":"Saidi-Mehrabad, M., Fattahi, P.: Flexible job shop scheduling with tabu search algorithms. Int. J. Adv. Manuf. Tech.\u00a032, 563\u2013570 (2007)","journal-title":"Int. J. Adv. Manuf. Tech."},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10845-009-0250-5","volume":"21","author":"M. Zandieh","year":"2010","unstructured":"Zandieh, M., Mozaffari, E., Gholami, M.: A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems. J. Intell. Manuf.\u00a021, 731\u2013743 (2010)","journal-title":"J. Intell. Manuf."},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1016\/j.cie.2008.07.021","volume":"56","author":"G. Zhang","year":"2009","unstructured":"Zhang, G., Shao, X., Li, P., Gao, L.: An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput. Ind. Eng.\u00a056, 1309\u20131318 (2009)","journal-title":"Comput. Ind. Eng."},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s10845-009-0246-1","volume":"21","author":"J. Arnaout","year":"2010","unstructured":"Arnaout, J., Rabadi, G., Musa, R.: A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. J. Intell. Manuf.\u00a021, 693\u2013701 (2010)","journal-title":"J. Intell. Manuf."},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1022235519958","volume":"6","author":"G. Vieira","year":"2003","unstructured":"Vieira, G., Hermann, J., Lin, E.: Rescheduling manufacturing systems: A framework of strategies, policies and methods. J. Scheduling\u00a06, 39\u201362 (2003)","journal-title":"J. Scheduling"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Aissani, N., Bekrar, A., Trentesaux, D., Beldjitali, B.: Dynamic scheduling for multi-site companies: A decisional approach based on reinforcement multi-agent learning. J. Intell. Manuf. (2011), doi:10.1007\/s10845-011-0580-y","DOI":"10.1007\/s10845-011-0580-y"},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0965-9978(00)00109-5","volume":"32","author":"C. Dimopoulos","year":"2001","unstructured":"Dimopoulos, C., Zalzala, A.: Investigating the use of genetic programming for a classic one-machine scheduling problem. Adv. Eng. Softw.\u00a032, 489\u2013498 (2001)","journal-title":"Adv. Eng. Softw."},{"key":"45_CR10","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10951-006-5591-8","volume":"9","author":"C. Geiger","year":"2006","unstructured":"Geiger, C., Uzsoy, R., Aytug, H.: Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach. J. Scheduling\u00a09, 7\u201334 (2006)","journal-title":"J. Scheduling"},{"key":"45_CR11","first-page":"87","volume":"13","author":"C. Ferreira","year":"2001","unstructured":"Ferreira, C.: Gene Expression Programming: A New Adaptive Algorithm for Solving Problems. Complex System\u00a013, 87\u2013129 (2001)","journal-title":"Complex System"},{"key":"45_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-45984-7_5","volume-title":"Genetic Programming","author":"C. Ferreira","year":"2002","unstructured":"Ferreira, C.: Discovery of the Boolean Functions to the Best Density-Classification Rules Using Gene Expression Programming. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol.\u00a02278, pp. 50\u201359. Springer, Heidelberg (2002)"},{"key":"45_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-27772-9_7","volume-title":"Advances in Web-Age Information Management","author":"J. Zuo","year":"2004","unstructured":"Zuo, J., Tang, C., Li, C., Yuan, C., Chen, A.: Time Series Prediction Based on Gene Expression Programming. In: Li, Q., Wang, G., Feng, L. (eds.) WAIM 2004. LNCS, vol.\u00a03129, pp. 55\u201364. Springer, Heidelberg (2004)"},{"key":"45_CR14","doi-asserted-by":"crossref","unstructured":"Chen, Y., Tang, C., Zhu, J.: Clustering without Prior Knowledge Based on Gene Expression Programming. In: 3rd International Conference on Natural Computation, pp. 451\u2013455 (2007)","DOI":"10.1109\/ICNC.2007.302"},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Nie, L., Gao, L., Li, P., Zhang, L.: Application of gene expression programming on dynamic job shop scheduling problem. In: 15th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2011, pp. 291\u2013295 (2011)","DOI":"10.1109\/CSCWD.2011.5960088"},{"key":"45_CR16","doi-asserted-by":"crossref","unstructured":"Nie, L., Gao, L., Li, P., Li, X.: A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates. J. Intell. Manuf. (2012), doi:10.1007\/s10845-012-0626-9","DOI":"10.1007\/s10845-012-0626-9"},{"key":"45_CR17","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F. Pezzella","year":"2008","unstructured":"Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Oper. Res.\u00a035, 3202\u20133212 (2008)","journal-title":"Comput. Oper. Res."},{"key":"45_CR18","unstructured":"Jackson, J.: Scheduling a Production Line to Minimize Maximum Tardiness. Research Report 43, Management Science Research Project, University of California at Los Angeles, Los Angeles, CA (1955)"},{"key":"45_CR19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0272-6963(82)90020-1","volume":"3","author":"K. Baker","year":"1982","unstructured":"Baker, K., Bertrand, J.: A dynamic priority rule for scheduling against due dates. J. Oper. Manag.\u00a03, 37\u201342 (1982)","journal-title":"J. Oper. Manag."},{"key":"45_CR20","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"S. Panwalkar","year":"1977","unstructured":"Panwalkar, S., Iskander, W.: A survey of scheduling rules. Oper. Res.\u00a025, 45\u201346 (1977)","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31020-1_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:40:46Z","timestamp":1620128446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31020-1_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642310195","9783642310201"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31020-1_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}