{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T01:55:45Z","timestamp":1649037345738},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T00:00:00Z","timestamp":1454457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s12351-016-0225-1","type":"journal-article","created":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T13:55:42Z","timestamp":1454507742000},"page":"275-295","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release dates"],"prefix":"10.1007","volume":"17","author":[{"given":"Sachchida Nand","family":"Chaurasia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shyam","family":"Sundar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alok","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,3]]},"reference":[{"key":"225_CR1","first-page":"394","volume":"94","author":"JE Beasley","year":"1996","unstructured":"Beasley JE, Chu PC (1996) A genetic algorithm for the set covering problem. European Journal of Operational Research 94:394\u2013404","journal-title":"European Journal of Operational Research"},{"key":"225_CR2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1022452626305","volume":"30","author":"I Birbil","year":"2003","unstructured":"Birbil I, Fang SC (2003) An electromagnetism-like mechanism for global optimization. Journal of Global Optimization 30:263\u2013282","journal-title":"Journal of Global Optimization"},{"key":"225_CR3","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1016\/j.eswa.2007.11.050","volume":"36","author":"PC Chang","year":"2009","unstructured":"Chang PC, Chen SH, Fan CY (2009) A hybrid electromagnetism-like algorithm for single machine scheduling problem. Expert Systems with Applications 36:1259\u20131267","journal-title":"Expert Systems with Applications"},{"issue":"15","key":"225_CR4","doi-asserted-by":"crossref","first-page":"3231","DOI":"10.1080\/00207540500103953","volume":"43","author":"J Curry","year":"2005","unstructured":"Curry J, Peters B (2005) Rescheduling parallel machines with stepwise increasing tardiness and machine assignment stability objectives. International Journal of Production Research 43(15):3231\u20133246","journal-title":"International Journal of Production Research"},{"key":"225_CR5","volume-title":"Handbook of Genetic Algorithms","author":"L Davis","year":"1991","unstructured":"Davis L (1991) Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York"},{"key":"225_CR6","unstructured":"Detienne B, Dauz\u00e8re-P\u00e9r\u00e8s S, Yugma C (2009) Scheduling in section operations subject to a fixed production schedule. In: Proceedings of the \n                        $$4{\\rm th}$$\n                        \n                            \n                                            \n                                \n                                    4\n                                    th\n                                \n                            \n                        \n                     Multidisciplinary International Conference (MISTA2009). Dublin, Ireland, pp 581\u2013593"},{"key":"225_CR7","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s10951-010-0203-z","volume":"14","author":"B Detienne","year":"2011","unstructured":"Detienne B, Dauz\u00e8re-P\u00e9r\u00e8s S, Yugma C (2011) Scheduling jobs on parallel machines to minimize a regular step total cost function. Journal of Scheduling 14:523\u2013538","journal-title":"Journal of Scheduling"},{"key":"225_CR8","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1016\/j.cor.2011.06.006","volume":"39","author":"B Detienne","year":"2012","unstructured":"Detienne B, Dauz\u00e8re-P\u00e9r\u00e8s S, Yugma C (2012) An exact approach for scheduling jobs with regular step cost functions on a single machine. Computer and Operations Research 39:1033\u20131043","journal-title":"Computer and Operations Research"},{"key":"225_CR9","doi-asserted-by":"crossref","unstructured":"Goldberg DE, Deb K (1991) A comparative analysis of selection schemes used in genetic algorithms. In: Proceedings of the 1991 Conference on Foundations of Genetic Algorithms. Morgan Kaufmann, pp 69\u201393","DOI":"10.1016\/B978-0-08-050684-5.50008-2"},{"key":"225_CR10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"4","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics 4:287\u2013326","journal-title":"Annals of Discrete Mathematics"},{"key":"225_CR11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10951-006-0004-6","volume":"10","author":"A Janiak","year":"2007","unstructured":"Janiak A, Krysiak T (2007) Single processor scheduling with job values depending on their completion times. Journal of Scheduling 10:129\u2013138","journal-title":"Journal of Scheduling"},{"key":"225_CR12","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical Report TR06. Computer Engineering Department, Erciyes University, Turkey"},{"key":"225_CR13","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization 39:459\u2013471","journal-title":"Journal of Global Optimization"},{"key":"225_CR14","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Applied Soft Computing 8:687\u2013697","journal-title":"Applied Soft Computing"},{"issue":"1","key":"225_CR15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artificial Intelligence Review 42(1):21\u201357","journal-title":"Artificial Intelligence Review"},{"key":"225_CR16","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Annals of Discrete Mathematics 1:343\u2013362","journal-title":"Annals of Discrete Mathematics"},{"key":"225_CR17","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1016\/S0305-0548(01)00039-9","volume":"29","author":"H Liang","year":"2002","unstructured":"Liang H, Yao X, Newton C, Hoffman D (2002) A new evolutionary approach to cutting stock problems with and without contiguity. Computers and Operations Research 29:1641\u20131659","journal-title":"Computers and Operations Research"},{"key":"225_CR18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0377-2217(02)00180-7","volume":"145","author":"R M\u2019Hallah","year":"2003","unstructured":"M\u2019Hallah R, Bulfin RL (2003) Minimizing the weighted number of tardy jobs on a single machine. European Journal of Operational Research 145:45\u201356","journal-title":"European Journal of Operational Research"},{"key":"225_CR19","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/j.ejor.2005.08.013","volume":"176","author":"R M\u2019Hallah","year":"2007","unstructured":"M\u2019Hallah R, Bulfin RL (2007) Minimizing the weighted number of tardy jobs on a single machine with release dates. European Journal of Operational Research 176:727\u2013744","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"225_CR20","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"MJ Moore","year":"1968","unstructured":"Moore MJ (1968) An \n                        $$n$$\n                        \n                            \n                                            \n                                n\n                            \n                        \n                     job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science 15(1):102\u2013109","journal-title":"Management Science"},{"key":"225_CR21","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 flowshop sequencing problem. Omega 11:91\u201395","journal-title":"Omega"},{"key":"225_CR22","doi-asserted-by":"crossref","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"QK Pan","year":"2011","unstructured":"Pan QK, Tasgetiren MF, Suganthan PN, Chua TJ (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information Sciences 181:2455\u20132468","journal-title":"Information Sciences"},{"issue":"5","key":"225_CR23","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.omega.2004.12.006","volume":"34","author":"R Ruiz","year":"2006","unstructured":"Ruiz R, Maroto C, Alcaraz J (2006) Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34(5):461\u2013476","journal-title":"Omega"},{"key":"225_CR24","unstructured":"Sahin G (2006) New combinatorial approaches for solving railroad planning and scheduling problems. Ph.D. Dissertation. University of Florida"},{"key":"225_CR25","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.tcs.2014.10.010","volume":"562","author":"Y Seddik","year":"2015","unstructured":"Seddik Y, Gonzales C, Kedad-Sidhoum S (2015) Performance guarantees for a scheduling problem with common stepwise job payoffs. Theoretical Computer Science 562:377\u2013394","journal-title":"Theoretical Computer Science"},{"key":"225_CR26","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/S0377-2217(02)00827-5","volume":"151","author":"M Sevaux","year":"2003","unstructured":"Sevaux M, Dauz\u00e8re-P\u00e9r\u00e8s S (2003) Genetic algorithms to minimize the weighted number of late jobs on a single machine. European Journal of Operational Research 151:296\u2013306","journal-title":"European Journal of Operational Research"},{"key":"225_CR27","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","volume":"9","author":"A Singh","year":"2009","unstructured":"Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Applied Soft Computing 9:625\u2013631","journal-title":"Applied Soft Computing"},{"key":"225_CR28","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.swevo.2011.12.002","volume":"4","author":"S Sundar","year":"2012","unstructured":"Sundar S, Singh A (2012) A swarm intelligence approach to the early\/tardy scheduling problem. Swarm and Evolutionary Computation 4:25\u201332","journal-title":"Swarm and Evolutionary Computation"},{"issue":"22","key":"225_CR29","doi-asserted-by":"crossref","first-page":"4737","DOI":"10.1080\/00207540600620849","volume":"44","author":"MF Tasgetiren","year":"2006","unstructured":"Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2006) Particle swarm optimization and differentialevolution for the single machine total weighted tardiness problem. International Journal of Production Research 44(22):4737\u20134754","journal-title":"International Journal of Production Research"},{"issue":"12","key":"225_CR30","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1080\/0305215X.2012.737785","volume":"45","author":"CT Tseng","year":"2013","unstructured":"Tseng CT, Chen KH (2013) An electromagnetism-like mechanism for the single machine total stepwise tardiness problem with release dates. Engineering Optimization 45(12):1431\u20131448","journal-title":"Engineering Optimization"},{"key":"225_CR31","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1080\/05695558308974657","volume":"15","author":"FJ Villareal","year":"1983","unstructured":"Villareal FJ, Bulfin RL (1983) Scheduling a single machine to minimize the weighted number of tardy jobs. IIE Transactions 15:337\u2013343","journal-title":"IIE Transactions"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-016-0225-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-016-0225-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-016-0225-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-016-0225-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T08:04:38Z","timestamp":1559462678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-016-0225-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,3]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["225"],"URL":"https:\/\/doi.org\/10.1007\/s12351-016-0225-1","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,3]]}}}