{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T23:56:23Z","timestamp":1782518183565,"version":"3.54.5"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"ELSAT","award":["Not applicable"],"award-info":[{"award-number":["Not applicable"]}]},{"name":"CNRS","award":["Not applicable"],"award-info":[{"award-number":["Not applicable"]}]},{"name":"LIA","award":["Not applicable"],"award-info":[{"award-number":["Not applicable"]}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","award":["RGPIN-2016-03896"],"award-info":[{"award-number":["RGPIN-2016-03896"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2022,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a mixed-integer-linear-program model for the problem, and third, to introduce two generalizable tabu-search metaheuristics relying on different neighborhood structures and solution spaces. Computational results for 120 instances (generated from a real case) are reported to empirically demonstrate the effectiveness of the proposed metaheuristics.<\/jats:p>","DOI":"10.1007\/s10951-021-00711-9","type":"journal-article","created":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T14:19:12Z","timestamp":1634480352000},"page":"89-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times"],"prefix":"10.1007","volume":"25","author":[{"given":"Hanane","family":"Krim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Zufferey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Yves","family":"Potvin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rachid","family":"Benmansour","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Duvivier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,10,17]]},"reference":[{"issue":"4","key":"711_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/acs.892","volume":"20","author":"E Aggelogiannaki","year":"2006","unstructured":"Aggelogiannaki, E., & Sarimveis, H. (2006). Multiobjective constrained MPC with simultaneous closed-loop identification. International Journal of Adaptive Control and Signal Processing, 20(4), 145\u2013173.","journal-title":"International Journal of Adaptive Control and Signal Processing"},{"issue":"4","key":"711_CR2","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s11590-016-1059-8","volume":"11","author":"A Agnetis","year":"2017","unstructured":"Agnetis, A., & Mosheiov, G. (2017). Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. Optimization Letters, 11(4), 885\u2013892.","journal-title":"Optimization Letters"},{"key":"711_CR3","doi-asserted-by":"crossref","unstructured":"Cao, Z., Wang, Z., Zhang, Y., & Liu, S. (2006). On several scheduling problems with rejection or discretely compressible processing times. In Theory and applications of models of computation (pp. 90\u201398).","DOI":"10.1007\/11750321_8"},{"issue":"6","key":"711_CR4","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1016\/j.cor.2010.09.018","volume":"39","author":"B Cesaret","year":"2012","unstructured":"Cesaret, B., O\u011fuz, C., & Salman, F. S. (2012). A tabu search algorithm for order acceptance and scheduling. Computers & Operations Research, 39(6), 1197\u20131205.","journal-title":"Computers & Operations Research"},{"key":"711_CR5","unstructured":"Ehrgott, M. (2005). Multicriteria optimization (Vol. 491). Springer."},{"issue":"5","key":"711_CR6","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1080\/0951192X.2015.1068452","volume":"29","author":"S Emami","year":"2016","unstructured":"Emami, S., Sabbagh, M., & Moslehi, G. (2016). A Lagrangian relaxation algorithm for order acceptance and scheduling problem: A globalised robust optimisation approach. International Journal of Computer Integrated Manufacturing, 29(5), 535\u2013560.","journal-title":"International Journal of Computer Integrated Manufacturing"},{"issue":"1","key":"711_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0196-6774(03)00078-6","volume":"49","author":"DW Engels","year":"2003","unstructured":"Engels, D. W., Karger, D. R., Kolliopoulos, S. G., Sengupta, S., Uma, R., & Wein, J. (2003). Techniques for scheduling with rejection. Journal of Algorithms, 49(1), 175\u2013191.","journal-title":"Journal of Algorithms"},{"key":"711_CR8","unstructured":"Gallay, O., & Zufferey, N. (2018). Metaheuristics for lexicographic optimization in industry. In Proceedings of the 19th EU\/ME Workshop on Metaheuristics for Industry (EU\/ME 2018)."},{"key":"711_CR9","doi-asserted-by":"crossref","unstructured":"Gendreau, M., & Potvin, J. Y. (2019). Handbook of Metaheuristics. International Series in Operations Research & Management Science (Vol. 146). Springer.","DOI":"10.1007\/978-3-319-91086-4"},{"issue":"3","key":"711_CR10","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F. (1989). Tabu search - Part I. ORSA Journal on Computing, 1(3), 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"711_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"711_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.cie.2017.02.021","volume":"107","author":"D Jiang","year":"2017","unstructured":"Jiang, D., Tan, J., & Li, B. (2017). Order acceptance and scheduling with batch delivery. Computers & Industrial Engineering, 107, 100\u2013104.","journal-title":"Computers & Industrial Engineering"},{"key":"711_CR13","unstructured":"Johnson, D. S. (1973). Near-optimal bin packing algorithms. Ph.D. Thesis, Massachusetts Institute of Technology."},{"issue":"2","key":"711_CR14","first-page":"238","volume":"3","author":"J Kaabi","year":"2014","unstructured":"Kaabi, J., & Harrath, Y. (2014). A survey of parallel machine scheduling under availability constraints. International Journal of Computer and Information Technology, 3(2), 238\u2013245.","journal-title":"International Journal of Computer and Information Technology"},{"key":"711_CR15","doi-asserted-by":"crossref","unstructured":"Kerrigan, E. C., & Maciejowski, J. M. (2002). Designing model predictive controllers with prioritised constraints and objectives. In Proceedings of IEEE international symposium on computer aided control system design, IEEE (pp. 33\u201338).","DOI":"10.1109\/CACSD.2002.1036925"},{"key":"711_CR16","doi-asserted-by":"crossref","unstructured":"Korte, B., Vygen, J., Korte, B., & Vygen, J. (2012). Combinatorial optimization (Vol. 2). Springer.","DOI":"10.1007\/978-3-642-24488-9"},{"key":"711_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ijpe.2017.01.014","volume":"186","author":"G Li","year":"2017","unstructured":"Li, G., Liu, M., Sethi, S. P., & Xu, D. (2017). Parallel-machine scheduling with machine-dependent maintenance periodic recycles. International Journal of Production Economics, 186, 1\u20137.","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"711_CR18","doi-asserted-by":"publisher","first-page":"1750010","DOI":"10.1142\/S0217595917500105","volume":"34","author":"SS Li","year":"2017","unstructured":"Li, S. S., & Chen, R. X. (2017). Scheduling with rejection and a deteriorating maintenance activity on a single machine. Asia-Pacific Journal of Operational Research, 34(2), 1750010. https:\/\/doi.org\/10.1142\/S0217595917500105.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"1","key":"711_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s40305-015-0093-z","volume":"4","author":"R Ma","year":"2016","unstructured":"Ma, R., & Yuan, J. J. (2016). Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines. Journal of the Operations Research Society of China, 4(1), 111\u2013119.","journal-title":"Journal of the Operations Research Society of China"},{"issue":"2","key":"711_CR20","doi-asserted-by":"publisher","first-page":"42","DOI":"10.4018\/jaec.2012040103","volume":"3","author":"A Moghaddam","year":"2012","unstructured":"Moghaddam, A., Amodeo, L., Yalaoui, F., & Karimi, B. (2012). Single machine scheduling with rejection: Minimizing total weighted completion time and rejection cost. International Journal of Applied Evolutionary Computation, 3(2), 42\u201361.","journal-title":"International Journal of Applied Evolutionary Computation"},{"issue":"1","key":"711_CR21","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.cor.2010.06.003","volume":"38","author":"FT Nobibon","year":"2011","unstructured":"Nobibon, F. T., & Leus, R. (2011). Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment. Computers & Operations Research, 38(1), 367\u2013378.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"711_CR22","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/TCST.2007.899741","volume":"16","author":"C Ocampo-Martinez","year":"2008","unstructured":"Ocampo-Martinez, C., Ingimundarson, A., Puig, V., & Quevedo, J. (2008). Objective prioritization using lexicographic minimizers for MPC of sewer networks. IEEE Transactions on Control Systems Technology, 16(1), 113\u2013121.","journal-title":"IEEE Transactions on Control Systems Technology"},{"issue":"1","key":"711_CR23","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.ijpe.2010.02.002","volume":"125","author":"C O\u011fuz","year":"2010","unstructured":"O\u011fuz, C., Sibel, S. F., & Bilgint\u00fcrk, Y. Z. (2010). Order acceptance and scheduling decisions in make-to-order systems. International Journal of Production Economics, 125(1), 200\u2013211.","journal-title":"International Journal of Production Economics"},{"issue":"1\u20132","key":"711_CR24","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10479-016-2277-2","volume":"248","author":"J Ou","year":"2017","unstructured":"Ou, J., & Zhong, X. (2017). Order acceptance and scheduling with consideration of service level. Annals of Operations Research, 248(1\u20132), 429\u2013447.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"711_CR25","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","volume":"241","author":"J Ou","year":"2015","unstructured":"Ou, J., Zhong, X., & Wang, G. (2015). An improved heuristic for parallel machine scheduling with rejection. European Journal of Operational Research, 241(3), 653\u2013661.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"711_CR26","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/opre.33.2.363","volume":"33","author":"CN Potts","year":"1985","unstructured":"Potts, C. N., & Van Wassenhove, L. N. (1985). A branch and bound algorithm for the total weighted tardiness problem. Operations Research, 33(2), 363\u2013377.","journal-title":"Operations Research"},{"issue":"1","key":"711_CR27","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ast.2009.11.003","volume":"14","author":"X Prats","year":"2010","unstructured":"Prats, X., Puig, V., Quevedo, J., & Nejjari, F. (2010). Lexicographic optimisation for optimal departure aircraft trajectories. Aerospace Science and Technology, 14(1), 26\u201337.","journal-title":"Aerospace Science and Technology"},{"key":"711_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2015\/198950","volume":"2015","author":"Y Qi","year":"2015","unstructured":"Qi, Y., Wan, L., & Yan, Z. (2015). Scheduling jobs with maintenance subject to load-dependent duration on a single machine. Mathematical Problems in Engineering, 2015, 1\u20136. https:\/\/doi.org\/10.1155\/2015\/198950.","journal-title":"Mathematical Problems in Engineering"},{"issue":"3","key":"711_CR29","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1002\/net.21656","volume":"67","author":"J Respen","year":"2016","unstructured":"Respen, J., Zufferey, N., & Amaldi, E. (2016). Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industry. Networks, 67(3), 246\u2013261.","journal-title":"Networks"},{"issue":"10","key":"711_CR30","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1057\/s41274-016-0136-9","volume":"68","author":"J Respen","year":"2017","unstructured":"Respen, J., Zufferey, N., & Wieser, P. (2017). Three-level inventory deployment for a luxury watch company facing various perturbations. Journal of the Operational Research Society, 68(10), 1195\u20131210.","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"711_CR31","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10878-010-9350-6","volume":"23","author":"D Shabtay","year":"2012","unstructured":"Shabtay, D., Gaspar, N., & Yedidsion, L. (2012). A bicriteria approach to scheduling a single machine with job rejection and positional penalties. Journal of Combinatorial Optimization, 23(4), 395\u2013424.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"711_CR32","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay, D., Gaspar, N., & Kaspi, M. (2013). A survey on offline scheduling with rejection. Journal of Scheduling, 16(1), 3\u201328.","journal-title":"Journal of Scheduling"},{"key":"711_CR33","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/s001700200097","volume":"19","author":"HJ Shin","year":"2002","unstructured":"Shin, H. J., Kim, C. O., & Kim, S. S. (2002). A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times. The International Journal of Advanced Manufacturing Technology, 19, 859\u2013866.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"1","key":"711_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.09.042","volume":"212","author":"SA Slotnick","year":"2011","unstructured":"Slotnick, S. A. (2011). Order acceptance and scheduling: A taxonomy and review. European Journal of Operational Research, 212(1), 1\u201311.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"711_CR35","doi-asserted-by":"publisher","first-page":"3029","DOI":"10.1016\/j.cor.2005.11.012","volume":"34","author":"SA Slotnick","year":"2007","unstructured":"Slotnick, S. A., & Morton, T. E. (2007). Order acceptance with weighted tardiness. Computers & Operations Research, 34(10), 3029\u20133042.","journal-title":"Computers & Operations Research"},{"issue":"1\u20132","key":"711_CR36","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3(1\u20132), 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"711_CR37","doi-asserted-by":"crossref","unstructured":"Solnon, C., Cung, V. D., Nguyen, A., & Artigues, C. (2008). The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF\u20192005 challenge problem. European Journal of Operational Research, 191(3), 912\u2013927.","DOI":"10.1016\/j.ejor.2007.04.033"},{"issue":"1","key":"711_CR38","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.ijpe.2009.10.018","volume":"124","author":"K Sun","year":"2010","unstructured":"Sun, K., & Li, H. (2010). Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines. International Journal of Production Economics, 124(1), 151\u2013158.","journal-title":"International Journal of Production Economics"},{"key":"711_CR39","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.dam.2018.03.019","volume":"261","author":"S Thevenin","year":"2019","unstructured":"Thevenin, S., & Zufferey, N. (2019). Learning variable neighborhood search for a scheduling problem with time windows and rejections. Discrete Applied Mathematics, 261, 344\u2013353.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"711_CR40","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10951-014-0395-8","volume":"18","author":"S Thevenin","year":"2015","unstructured":"Thevenin, S., Zufferey, N., & Widmer, M. (2015). Metaheuristics for a scheduling problem with rejection and tardiness penalties. Journal of Scheduling, 18(1), 89\u2013105.","journal-title":"Journal of Scheduling"},{"issue":"6","key":"711_CR41","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s10732-016-9321-x","volume":"22","author":"S Thevenin","year":"2016","unstructured":"Thevenin, S., Zufferey, N., & Widmer, M. (2016). Order acceptance and scheduling with earliness and tardiness penalties. Journal of Heuristics, 22(6), 849\u2013890.","journal-title":"Journal of Heuristics"},{"issue":"1","key":"711_CR42","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10479-017-2498-z","volume":"259","author":"S Thevenin","year":"2017","unstructured":"Thevenin, S., Zufferey, N., & Glardon, R. (2017a). Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution. Annals of Operations Research, 259(1), 437\u2013460.","journal-title":"Annals of Operations Research"},{"issue":"6","key":"711_CR43","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1080\/00207543.2016.1181285","volume":"55","author":"S Thevenin","year":"2017","unstructured":"Thevenin, S., Zufferey, N., & Potvin, J. Y. (2017b). Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility. International Journal of Production Research, 55(6), 1588\u20131606.","journal-title":"International Journal of Production Research"},{"key":"711_CR44","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.dam.2016.05.023","volume":"234","author":"S Thevenin","year":"2018","unstructured":"Thevenin, S., Zufferey, N., & Potvin, J. Y. (2018). Graph multi-coloring for a job scheduling application. Discrete Applied Mathematics, 234, 218\u2013235.","journal-title":"Discrete Applied Mathematics"},{"key":"711_CR45","unstructured":"T\u2019kindt, V, & Billaut, J. C. (2006). Multicriteria scheduling: Theory, models and algorithms. Springer."},{"issue":"1","key":"711_CR46","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/j.ijpe.2012.08.020","volume":"141","author":"X Wang","year":"2013","unstructured":"Wang, X., Xingzi, X., & Cheng, T. (2013). Order acceptance and scheduling in a two-machine flowshop. International Journal of Production Economics, 141(1), 366\u2013376.","journal-title":"International Journal of Production Economics"},{"issue":"10","key":"711_CR47","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1057\/jors.2015.3","volume":"66","author":"X Wang","year":"2015","unstructured":"Wang, X., Huang, G., Hu, X., & Cheng, T. E. (2015). Order acceptance and scheduling on two identical parallel machines. Journal of the Operational Research Society, 66(10), 1755\u20131767.","journal-title":"Journal of the Operational Research Society"},{"key":"711_CR48","first-page":"111","volume":"9","author":"SX Zhang","year":"2009","unstructured":"Zhang, S. X., Cao, Z., & Zhang, Y. (2009). Scheduling with rejection to minimize the total weighted completion time. International Symposium on Operations Research and its Applications, 9, 111\u2013114.","journal-title":"International Symposium on Operations Research and its Applications"},{"key":"711_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.05.033","volume":"690","author":"X Zhong","year":"2017","unstructured":"Zhong, X., & Ou, J. (2017). Parallel machine scheduling with restricted job rejection. Theoretical Computer Science, 690, 1\u201311.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"711_CR50","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ejor.2013.07.032","volume":"232","author":"X Zhong","year":"2014","unstructured":"Zhong, X., Ou, J., & Wang, G. (2014). Order acceptance and scheduling with machine availability constraints. European Journal of Operational Research, 232(3), 435\u2013441.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"711_CR51","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1007\/s10878-016-0016-x","volume":"33","author":"X Zhong","year":"2017","unstructured":"Zhong, X., Pan, Z., & Jiang, D. (2017). Scheduling with release times and rejection on two parallel machines. Journal of Combinatorial Optimization, 33(3), 934\u2013944.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"711_CR52","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1051\/ro\/2014027","volume":"49","author":"N Zufferey","year":"2015","unstructured":"Zufferey, N., & Vasquez, M. (2015). A generalized consistent neighborhood search for satellite range scheduling problems. RAIRO-Operations Research, 49(1), 99\u2013121.","journal-title":"RAIRO-Operations Research"},{"key":"711_CR53","unstructured":"Zufferey, N., Molin, D. D., Glardon, R., & Tsagkalidis, C. (2017). Handbook of Research on Applied Optimization Methodologies in Manufacturing Systems, IGI Global, chap A Simulation-Optimization Approach for the Production of Components for a Pharmaceutical Company (ISBN: 978-1-52252-944-6)."},{"issue":"3","key":"711_CR54","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/B:AURC.0000019366.84601.8e","volume":"65","author":"AV Zykina","year":"2004","unstructured":"Zykina, A. V. (2004). A lexicographic optimization algorithm. Automation and Remote Control, 65(3), 363\u2013368.","journal-title":"Automation and Remote Control"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-021-00711-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-021-00711-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-021-00711-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T17:20:40Z","timestamp":1675790440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-021-00711-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["711"],"URL":"https:\/\/doi.org\/10.1007\/s10951-021-00711-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,17]]},"assertion":[{"value":"29 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}