{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:45:36Z","timestamp":1740149136182,"version":"3.37.3"},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T00:00:00Z","timestamp":1615939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T00:00:00Z","timestamp":1615939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s12351-021-00629-2","type":"journal-article","created":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T05:26:49Z","timestamp":1615958809000},"page":"2721-2765","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Modeling and solution methods for hybrid flow shop scheduling problem with job rejection"],"prefix":"10.1007","volume":"22","author":[{"given":"Mohamadreza","family":"Dabiri","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4357-5387","authenticated-orcid":false,"given":"Mehdi","family":"Yazdani","sequence":"additional","affiliation":[]},{"given":"Bahman","family":"Naderi","sequence":"additional","affiliation":[]},{"given":"Hassan","family":"Haleh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,17]]},"reference":[{"issue":"5","key":"629_CR1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.omega.2004.01.004","volume":"32","author":"T Aldowaisan","year":"2004","unstructured":"Aldowaisan T, Allahverdi A (2004) New heuristics for m-machine no-wait flowshop to minimize total completion time. Omega 32(5):345\u2013352","journal-title":"Omega"},{"issue":"1","key":"629_CR2","first-page":"1","volume":"1","author":"TM Asgari","year":"2014","unstructured":"Asgari TM, Zandieh M (2014) A cloud-based simulated annealing algorithm for order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling. J Indus Eng Manage Stud 1(1):1\u201319","journal-title":"J Indus Eng Manage Stud"},{"issue":"1","key":"629_CR3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.disopt.2004.12.003","volume":"2","author":"P Baptiste","year":"2005","unstructured":"Baptiste P, Le Pape C (2005) Scheduling a single machine to minimize a regular objective function under setup constraints. Discret Optim 2(1):83\u201399","journal-title":"Discret Optim"},{"issue":"1","key":"629_CR4","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal Y, Leonardi S, Marchetti-Spaccamela A, Sgall J, Stougie L (2000) Multiprocessor scheduling with rejection. SIAM J Discret Math 13(1):64\u201378","journal-title":"SIAM J Discret Math"},{"issue":"1","key":"629_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0377-2217(97)00423-2","volume":"113","author":"S Brah","year":"1999","unstructured":"Brah S, Loo L (1999) Heuristics for scheduling in a flow shop with multiple processors. Eur J Oper Res 113(1):113\u2013122","journal-title":"Eur J Oper Res"},{"key":"629_CR6","doi-asserted-by":"crossref","first-page":"106863","DOI":"10.1016\/j.cie.2020.106863","volume":"149","author":"RH Caldeira","year":"2020","unstructured":"Caldeira RH, Gnanavelbabu A, Vaidyanathan T (2020) An effective backtracking search algorithm for multi-objective flexible job shop scheduling considering new job arrivals and energy consumption. Comput Ind Eng 149:106863","journal-title":"Comput Ind Eng"},{"issue":"27\u201329","key":"629_CR7","doi-asserted-by":"crossref","first-page":"2732","DOI":"10.1016\/j.tcs.2009.04.006","volume":"410","author":"Z Cao","year":"2009","unstructured":"Cao Z, Yang X (2009) A PTAS for parallel batch scheduling with rejection and dynamic job arrivals. Theoret Comput Sci 410(27\u201329):2732\u20132745","journal-title":"Theoret Comput Sci"},{"issue":"4","key":"629_CR8","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s11424-007-9050-1","volume":"20","author":"Z Cao","year":"2007","unstructured":"Cao Z, Zhang Y (2007) Scheduling with rejection and non-identical job arrivals. J Syst Sci Comple 20(4):529\u2013535","journal-title":"J Syst Sci Comple"},{"key":"629_CR9","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/11750321_8","volume":"3959","author":"Z Cao","year":"2006","unstructured":"Cao Z, Wang Z, Liu S (2006) On several scheduling problems with rejection or discretely compressible processing times. Lect Notes Comput Sci 3959:90\u201398","journal-title":"Lect Notes Comput Sci"},{"key":"629_CR10","doi-asserted-by":"crossref","unstructured":"Chaurasia SN, Kim JH (2019) An artificial bee colony based hyper-heuristic for the single machine order acceptance and scheduling problem. In: Deep K, Jain M, Salhi S (eds) Decision science in action. Asset analytics (performance and safety management). Springer","DOI":"10.1007\/978-981-13-0860-4_5"},{"issue":"1","key":"629_CR11","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.ejor.2007.11.047","volume":"194","author":"Y Cheng","year":"2009","unstructured":"Cheng Y, Sun S (2009) Scheduling linear deteriorating jobs with rejection on a single machine. Eur J Oper Res 194(1):18\u201327","journal-title":"Eur J Oper Res"},{"issue":"8","key":"629_CR12","doi-asserted-by":"crossref","first-page":"3729","DOI":"10.1016\/j.asoc.2013.03.006","volume":"13","author":"TP Chung","year":"2013","unstructured":"Chung TP, Liao CJ (2013) An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem. Appl Soft Comput 13(8):3729\u20133736","journal-title":"Appl Soft Comput"},{"key":"629_CR13","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.cor.2018.10.006","volume":"102","author":"R Cordone","year":"2019","unstructured":"Cordone R, Hosteins P (2019) A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization. Comput Oper Res 102:130\u2013140","journal-title":"Comput Oper Res"},{"issue":"2","key":"629_CR14","first-page":"158","volume":"32","author":"M Dabiri","year":"2019","unstructured":"Dabiri M, Darestani SA, Naderi B (2019) Multi-machine flow shop scheduling problems with rejection using genetic algorithm. Int J Serv Oper Manage 32(2):158\u2013172","journal-title":"Int J Serv Oper Manage"},{"issue":"2","key":"629_CR15","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan TAMT (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"629_CR16","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1016\/j.ejor.2016.11.036","volume":"259","author":"F Della Croce","year":"2017","unstructured":"Della Croce F, Koulamas C, T\u2019kindt V (2017) A constraint generation approach for two-machine shop problems with jobs selection. Eur J Oper Res 259(3):898\u2013905","journal-title":"Eur J Oper Res"},{"issue":"12","key":"629_CR17","doi-asserted-by":"crossref","first-page":"3962","DOI":"10.1016\/j.cor.2007.05.005","volume":"35","author":"X Dong","year":"2008","unstructured":"Dong X, Huang H, Chen P (2008) An improved NEH-based heuristic for the permutation flowshop problem. Comput Oper Res 35(12):3962\u20133968","journal-title":"Comput Oper Res"},{"issue":"5","key":"629_CR18","doi-asserted-by":"crossref","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. Int J Comput Integr Manuf 29(5):535\u2013560","journal-title":"Int J Comput Integr Manuf"},{"issue":"4","key":"629_CR19","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1007\/s40314-015-0302-8","volume":"36","author":"S Emami","year":"2017","unstructured":"Emami S, Moslehi G, Sabbagh M (2017) A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach. Comput Appl Math 36(4):1471\u20131515","journal-title":"Comput Appl Math"},{"key":"629_CR20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0196-6774(03)00078-6","volume":"49","author":"DW Engels","year":"2003","unstructured":"Engels DW, Karger DR, Kolliopoulos SG, Segupta S, Uma RN, Wein J (2003) Techniques for scheduling with rejection. Journal of Algorithms 49:175\u2013191","journal-title":"Journal of Algorithms"},{"issue":"2","key":"629_CR21","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.ejor.2015.11.036","volume":"251","author":"R Esmaeilbeigi","year":"2016","unstructured":"Esmaeilbeigi R, Charkhgard P, Charkhgard H (2016) Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations. Eur J Oper Res 251(2):419\u2013431","journal-title":"Eur J Oper Res"},{"key":"629_CR22","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cor.2015.02.002","volume":"60","author":"V Fernandez-Viagas","year":"2015","unstructured":"Fernandez-Viagas V, Framinan J (2015) NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness. Comput Oper Res 60:27\u201336","journal-title":"Comput Oper Res"},{"key":"629_CR23","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ipl.2017.12.004","volume":"132","author":"S Fiszman","year":"2018","unstructured":"Fiszman S, Mosheiov G (2018) Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection. Inf Process Lett 132:39\u201343","journal-title":"Inf Process Lett"},{"key":"629_CR24","doi-asserted-by":"crossref","unstructured":"Framinan JM, Leisten R, Ruiz R (2014) Manufacturing scheduling systems: an integrated view on models, methods and tools. Springer","DOI":"10.1007\/978-1-4471-6272-8"},{"issue":"9","key":"629_CR25","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1080\/0305215X.2015.1120298","volume":"48","author":"C Garcia","year":"2016","unstructured":"Garcia C (2016) Resource-constrained scheduling with hard due windows and rejection penalties. Eng Optim 48(9):1515\u20131528","journal-title":"Eng Optim"},{"issue":"1","key":"629_CR26","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1057\/s41274-016-0007-4","volume":"68","author":"S Geramipour","year":"2017","unstructured":"Geramipour S, Moslehi G, Reisi-Nafchi M (2017) Maximizing the profit in customer\u2019s order acceptance and scheduling problem with weighted tardiness penalty. J Oper Res Soc 68(1):89\u2013101","journal-title":"J Oper Res Soc"},{"key":"629_CR27","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1988.63","author":"JND Gupta","year":"1988","unstructured":"Gupta JND (1988) Two-stage, hybrid flowshop scheduling problem. J Oper Res Soc. https:\/\/doi.org\/10.1057\/jors.1988.63","journal-title":"J Oper Res Soc"},{"issue":"1","key":"629_CR28","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.ejor.2018.07.038","volume":"273","author":"D Hermelin","year":"2019","unstructured":"Hermelin D, Pinedo M, Shabtay D, Talmon N (2019) On the parameterized tractability of single machine scheduling with rejection. Eur J Oper Res 273(1):67\u201373","journal-title":"Eur J Oper Res"},{"issue":"5","key":"629_CR29","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/j.engappai.2010.01.008","volume":"23","author":"S Khalouli","year":"2010","unstructured":"Khalouli S, Ghedjati F, Hamzaoui A (2010) A meta-heuristic approach to solve a jit scheduling problem in hybrid flow shop. Eng Appl Artif Intell 23(5):765\u2013771","journal-title":"Eng Appl Artif Intell"},{"key":"629_CR30","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1007\/978-3-540-87744-8_50","volume":"5193","author":"S Khuller","year":"2008","unstructured":"Khuller S, Mestre J (2008) An optimal incremental algorithm for minimizing lateness with rejection. Lect Notes Comput Sci 5193:601\u2013610","journal-title":"Lect Notes Comput Sci"},{"key":"629_CR31","unstructured":"Kong M, Liu X, Pei J, Zhou Z, Pardalos PM (2019) Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine. Optim Lett, pp 1\u201315"},{"key":"629_CR32","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/j.cie.2015.07.020","volume":"88","author":"C Koulamas","year":"2015","unstructured":"Koulamas C, Panwalkar SS (2015) Job selection in two-stage shops with ordered machines. Comput Ind Eng 88:350\u2013353","journal-title":"Comput Ind Eng"},{"key":"629_CR33","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.ijpe.2015.03.013","volume":"165","author":"D Lei","year":"2015","unstructured":"Lei D, Guo X (2015) A parallel neighborhood search for order acceptance and scheduling in flowshop environment. Int J Prod Econ 165:12\u201318","journal-title":"Int J Prod Econ"},{"key":"629_CR34","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.asoc.2014.07.005","volume":"24","author":"J-Q Li","year":"2014","unstructured":"Li J-Q, Pan Q-K, Wang F-T (2014) A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem. Appl Soft Comput 24:63\u201377","journal-title":"Appl Soft Comput"},{"issue":"6","key":"629_CR35","doi-asserted-by":"crossref","first-page":"1755","DOI":"10.1016\/j.asoc.2012.01.011","volume":"12","author":"C-J Liao","year":"2012","unstructured":"Liao C-J, Tjandradjaja E, Chung T-P (2012) An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem. Appl Soft Comput 12(6):1755\u20131764","journal-title":"Appl Soft Comput"},{"key":"629_CR36","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1016\/j.asoc.2015.01.069","volume":"30","author":"SW Lin","year":"2015","unstructured":"Lin SW, Ying KC (2015) Order acceptance and scheduling to maximize total net revenue in permutation flowshops with weighted tardiness. Appl Soft Comput 30:462\u2013474","journal-title":"Appl Soft Comput"},{"issue":"1\u20133","key":"629_CR37","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.tcs.2008.02.015","volume":"396","author":"L Lu","year":"2008","unstructured":"Lu L, Zhang L, Yuan J (2008) The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theoret Comput Sci 396(1\u20133):283\u2013289","journal-title":"Theoret Comput Sci"},{"issue":"10","key":"629_CR38","doi-asserted-by":"crossref","first-page":"2748","DOI":"10.1016\/j.cor.2008.12.003","volume":"36","author":"L Lu","year":"2009","unstructured":"Lu L, Cheng TCE, Yuan J, Zhang L (2009) Bounded single-machine parallel-batch scheduling with release dates and rejection. Comput Oper Res 36(10):2748\u20132751","journal-title":"Comput Oper Res"},{"issue":"1","key":"629_CR39","first-page":"15","volume":"5","author":"M Marichelvam","year":"2013","unstructured":"Marichelvam M, Prabaharan T, Yang X-S, Geetha M (2013) Solving hybrid flow shop scheduling problems using bat algorithm. Int J Logist Econ Glob 5(1):15\u201329","journal-title":"Int J Logist Econ Glob"},{"key":"629_CR40","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.asoc.2014.02.005","volume":"19","author":"M Marichelvam","year":"2014","unstructured":"Marichelvam M, Prabaharan T, Yang X-S (2014) Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan. Appl Soft Comput 19:93\u2013101","journal-title":"Appl Soft Comput"},{"key":"629_CR41","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s00170-013-5265-6","volume":"70","author":"N Mohsen","year":"2014","unstructured":"Mohsen N, Iraj M (2014) Multi-job lot streaming to minimize the weighted completion time in a hybrid flow shop scheduling problem with work shift constraint. Int J Adv Manuf Technol 70:501\u2013514","journal-title":"Int J Adv Manuf Technol"},{"key":"629_CR42","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.asoc.2014.09.040","volume":"26","author":"H Mokhtari","year":"2015","unstructured":"Mokhtari H (2015) A nature inspired intelligent water drops evolutionary algorithm for parallel processor scheduling with rejection. Appl Soft Comput 26:166\u2013179","journal-title":"Appl Soft Comput"},{"issue":"24","key":"629_CR43","doi-asserted-by":"crossref","first-page":"5767","DOI":"10.1016\/j.apm.2014.04.012","volume":"38","author":"B Naderi","year":"2014","unstructured":"Naderi B, Gohari S, Yazdani M (2014) Hybrid flexible flowshop problems: Models and solution methods. Appl Math Model 38(24):5767\u20135780","journal-title":"Appl Math Model"},{"issue":"4\u20135","key":"629_CR44","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s11740-017-0747-2","volume":"11","author":"MS Nagano","year":"2017","unstructured":"Nagano MS, Rossi FL, Tomazella CP (2017) A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop. Prod Eng Res Devel 11(4\u20135):523\u2013529","journal-title":"Prod Eng Res Devel"},{"issue":"1","key":"629_CR45","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91\u201395","journal-title":"Omega"},{"issue":"5\u20138","key":"629_CR46","doi-asserted-by":"crossref","first-page":"2021","DOI":"10.1007\/s00170-015-8321-6","volume":"86","author":"S Nguyen","year":"2016","unstructured":"Nguyen S (2016) A learning and optimizing system for order acceptance and scheduling. Int J Adv Manufact Technol 86(5\u20138):2021\u20132036","journal-title":"Int J Adv Manufact Technol"},{"key":"629_CR47","first-page":"124","volume-title":"Genetic programming","author":"S Nguyen","year":"2014","unstructured":"Nguyen S, Zhang M, Johnston M (2014a) Enhancing branch-and-bound algorithms for order acceptance and scheduling with genetic programming. In: Nicolau M, Krawiec K, Heywood MI, Castelli M, Garcia-Sanchez P, Merelo JJ, Rivas Santos VM, Sim K (eds) Genetic programming, 1st edn. Springer, pp 124\u2013136","edition":"1"},{"key":"629_CR48","doi-asserted-by":"crossref","unstructured":"Nguyen S, Zhang M, Johnston M (2014) A sequential genetic programming method to learn forward construction heuristics for order acceptance and scheduling. In: 2014 IEEE congress on evolutionary computation (CEC). IEEE, pp 1824\u20131831","DOI":"10.1109\/CEC.2014.6900347"},{"issue":"1\u20132","key":"629_CR49","doi-asserted-by":"crossref","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. Ann Oper Res 248(1\u20132):429\u2013447","journal-title":"Ann Oper Res"},{"issue":"3","key":"629_CR50","doi-asserted-by":"crossref","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. Eur J Oper Res 241(3):653\u2013661","journal-title":"Eur J Oper Res"},{"key":"629_CR51","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.ins.2014.02.152","volume":"277","author":"Q-K Pan","year":"2014","unstructured":"Pan Q-K, Dong Y (2014) An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation. Inf Sci 277:643\u2013655","journal-title":"Inf Sci"},{"issue":"42","key":"629_CR52","first-page":"56","volume":"45","author":"Q-K Pan","year":"2014","unstructured":"Pan Q-K, Wang L, Li J-Q, Duan J-H (2014) A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation. Omega (United Kingdom) 45(42):56","journal-title":"Omega (United Kingdom)"},{"key":"629_CR53","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.amc.2017.01.004","volume":"303","author":"QK Pan","year":"2017","unstructured":"Pan QK, Gao L, Li XY, Gao KZ (2017) Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times. Appl Math Comput 303:89\u2013112","journal-title":"Appl Math Comput"},{"key":"629_CR54","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.cor.2016.11.022","volume":"80","author":"QK Pan","year":"2017","unstructured":"Pan QK, Ruiz R, Alfaro-Fern\u00e1ndez P (2017) Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows. Comput Oper Res 80:50\u201360","journal-title":"Comput Oper Res"},{"issue":"2","key":"629_CR55","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.ejor.2015.06.018","volume":"247","author":"HF Rahman","year":"2015","unstructured":"Rahman HF, Sarker R, Essam D (2015) A real-time order acceptance and scheduling approach for permutation flow shop problems. Eur J Oper Res 247(2):488\u2013503","journal-title":"Eur J Oper Res"},{"key":"629_CR56","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.asoc.2015.04.027","volume":"33","author":"M Reisi-Nafchi","year":"2015","unstructured":"Reisi-Nafchi M, Moslehi G (2015) \u2018A hybrid genetic and linear programming algorithm for two-agent order acceptance and scheduling problem. Appl Soft Comput 33:37\u201347","journal-title":"Appl Soft Comput"},{"key":"629_CR57","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-540-45078-8_8","volume":"2748","author":"S Sengupta","year":"2003","unstructured":"Sengupta S (2003) Algorithms and approximation schemes for minimum lateness\/tardiness scheduling with rejection. Lect Notes Comput Sci 2748:79\u201390","journal-title":"Lect Notes Comput Sci"},{"issue":"5","key":"629_CR58","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1016\/j.cor.2011.05.023","volume":"39","author":"D Shabtay","year":"2012","unstructured":"Shabtay D, Gasper N (2012) Two-machine flow-shop scheduling with rejection. Comput Oper Res 39(5):1087\u20131096","journal-title":"Comput Oper Res"},{"issue":"5","key":"629_CR59","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1057\/jors.2015.95","volume":"67","author":"D Shabtay","year":"2016","unstructured":"Shabtay D, Oron D (2016) Proportionate flow-shop scheduling with rejection. J Oper Res Soc 67(5):752\u2013769","journal-title":"J Oper Res Soc"},{"issue":"4","key":"629_CR60","doi-asserted-by":"crossref","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. J Comb Optim 23(4):395\u2013424","journal-title":"J Comb Optim"},{"key":"629_CR61","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.cor.2017.09.006","volume":"90","author":"YLT Silva","year":"2018","unstructured":"Silva YLT, Subramanian A, Pessoa AA (2018) Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times. Comput Oper Res 90:142\u2013160","journal-title":"Comput Oper Res"},{"key":"629_CR62","doi-asserted-by":"crossref","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. Discret Appl Math 261:344\u2013353","journal-title":"Discret Appl Math"},{"issue":"1","key":"629_CR63","doi-asserted-by":"crossref","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. J Sched 18(1):89\u2013105","journal-title":"J Sched"},{"issue":"6","key":"629_CR64","doi-asserted-by":"crossref","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. J Heurist 22(6):849\u2013890","journal-title":"J Heurist"},{"key":"629_CR65","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.cor.2018.12.016","volume":"104","author":"S Wang","year":"2019","unstructured":"Wang S, Ye B (2019) Exact methods for order acceptance and scheduling on unrelated parallel machines. Comput Oper Res 104:159\u2013173","journal-title":"Comput Oper Res"},{"issue":"9","key":"629_CR66","doi-asserted-by":"crossref","first-page":"2043","DOI":"10.1007\/s00170-013-4819-y","volume":"68","author":"S Wang","year":"2013","unstructured":"Wang S, Wang L, Liu M, Xu Y (2013) An enhanced estimation of distribution algorithm for solving hybrid flow-shop scheduling problem with identical parallel machines. Int J Adv Manuf Technol 68(9):2043\u20132056","journal-title":"Int J Adv Manuf Technol"},{"issue":"10","key":"629_CR67","doi-asserted-by":"crossref","first-page":"1755","DOI":"10.1057\/jors.2015.3","volume":"66","author":"X Wang","year":"2015","unstructured":"Wang X, Huang G, Hu X, Cheng TE (2015) Order acceptance and scheduling on two identical parallel machines. J Oper Res Soc 66(10):1755\u20131767","journal-title":"J Oper Res Soc"},{"issue":"12","key":"629_CR68","doi-asserted-by":"crossref","first-page":"3691","DOI":"10.1080\/00207543.2015.1136081","volume":"54","author":"DJ Wang","year":"2016","unstructured":"Wang DJ, Yin Y, Liu M (2016) Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity. Int J Prod Res 54(12):3691\u20133705","journal-title":"Int J Prod Res"},{"key":"629_CR69","doi-asserted-by":"crossref","unstructured":"Wang J, Zhuang X, Wu B (2017) A new model and method for order selection problems in flow-shop production. In: Choi TM, Gao J, Lambert J, Ng CK, Wang J (eds) Optimization and control for systems in the big-data era. International series in operations research & management science, vol 252. Springer","DOI":"10.1007\/978-3-319-53518-0_13"},{"key":"629_CR70","doi-asserted-by":"crossref","unstructured":"Wang D, Yin Y, Cheng TCE (2018) Parallel-machine rescheduling with job unavailability and rejection. Omega","DOI":"10.1016\/j.omega.2018.04.008"},{"key":"629_CR71","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/j.cie.2018.11.021","volume":"127","author":"Z Wang","year":"2019","unstructured":"Wang Z, Qi Y, Cui H, Zhang J (2019) A hybrid algorithm for order acceptance and scheduling problem in make-to-stock\/make-to-order industries. Comput Ind Eng 127:841\u2013852","journal-title":"Comput Ind Eng"},{"key":"629_CR72","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.amc.2015.08.011","volume":"270","author":"Y Xiao","year":"2015","unstructured":"Xiao Y, Yuan Y, Zhang RQ, Konak A (2015) Non-permutation flow shop scheduling with order acceptance and weighted tardiness. Appl Math Comput 270:312\u2013333","journal-title":"Appl Math Comput"},{"key":"629_CR73","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.asoc.2016.03.027","volume":"44","author":"X Xie","year":"2016","unstructured":"Xie X, Wang X (2016) An enhanced ABC algorithm for single machine order acceptance and scheduling with class setups. Appl Soft Comput 44:255\u2013266","journal-title":"Appl Soft Comput"},{"issue":"12","key":"629_CR74","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1080\/0305215X.2012.737784","volume":"45","author":"Y Xu","year":"2013","unstructured":"Xu Y, Wang L, Wang S, Liu M (2013) An effective shuffled frog-leaping algorithm for solving the hybrid flow-shop scheduling problem with identical parallel machines. Eng Optim 45(12):1409\u20131430","journal-title":"Eng Optim"},{"issue":"19","key":"629_CR75","doi-asserted-by":"crossref","first-page":"5797","DOI":"10.1080\/00207543.2015.1005768","volume":"53","author":"L Xu","year":"2015","unstructured":"Xu L, Wang Q, Huang S (2015) Dynamic order acceptance and scheduling problem with sequence-dependent setup time. Int J Prod Res 53(19):5797\u20135808","journal-title":"Int J Prod Res"},{"key":"629_CR76","unstructured":"Yavari M, Marvi M, Akbari AH (2019) Semi-permutation-based genetic algorithm for order acceptance and scheduling in two-stage assembly problem. Neural Comput Appl, pp 1\u201315"},{"issue":"3","key":"629_CR77","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1007\/s12597-019-00395-y","volume":"56","author":"M Yazdani","year":"2019","unstructured":"Yazdani M, Zandieh M, Tavakkoli-Moghaddam R (2019) Evolutionary algorithms for multi-objective dual-resource constrained flexible job-shop scheduling problem. Opsearch 56(3):983\u20131006","journal-title":"Opsearch"},{"key":"629_CR78","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.cie.2017.04.002","volume":"108","author":"H Ye","year":"2017","unstructured":"Ye H, Li W, Abedini A, Nault B (2017) An effective and efficient heuristic for no-wait flow shop production to minimize total completion time. Comput Ind Eng 108:57\u201369","journal-title":"Comput Ind Eng"},{"issue":"4","key":"629_CR79","first-page":"312","volume":"34","author":"M Zandieh","year":"2017","unstructured":"Zandieh M, Roumani M (2017) A biogeography-based optimization algorithm for order acceptance and scheduling. J Ind Prod Eng 34(4):312\u2013321","journal-title":"J Ind Prod Eng"},{"key":"629_CR80","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","volume":"198","author":"Y Zhang","year":"2009","unstructured":"Zhang Y, Lu L, Yuan J (2009) Single machine scheduling with release dates and rejection. Eur J Oper Res 198:975\u2013978","journal-title":"Eur J Oper Res"},{"key":"629_CR81","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/978-3-642-02026-1_39","volume":"5573","author":"Y Zhang","year":"2009","unstructured":"Zhang Y, Ren J, Wang C (2009) Scheduling with rejection to minimize the makespan. Lect Notes Comput Sci 5573:411\u2013420","journal-title":"Lect Notes Comput Sci"},{"key":"629_CR82","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.asoc.2016.12.021","volume":"52","author":"B Zhang","year":"2017","unstructured":"Zhang B, Pan QK, Gao L, Zhang XL, Sang HY, Li JQ (2017) An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming. Appl Soft Comput 52:14\u201327","journal-title":"Appl Soft Comput"},{"key":"629_CR83","doi-asserted-by":"crossref","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. Theoret Comput Sci 690:1\u201311","journal-title":"Theoret Comput Sci"},{"key":"629_CR84","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10288-016-0339-6","volume":"15","author":"XL Zhong","year":"2017","unstructured":"Zhong XL, Ou JW (2017) Improved approximation algorithms for parallel machine scheduling with release dates and job rejection. 4OR-A Q. J Oper Res 15:387\u2013406","journal-title":"J Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00629-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-021-00629-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00629-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T03:30:12Z","timestamp":1724643012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-021-00629-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,17]]},"references-count":84,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["629"],"URL":"https:\/\/doi.org\/10.1007\/s12351-021-00629-2","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2021,3,17]]},"assertion":[{"value":"20 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}