{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:16:30Z","timestamp":1719965790672},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T00:00:00Z","timestamp":1718323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T00:00:00Z","timestamp":1718323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-024-00330-y","type":"journal-article","created":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T10:01:55Z","timestamp":1718359315000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Self-Adaptive Biased Differential Evolution for Scheduling Against Common Due Dates"],"prefix":"10.1007","volume":"5","author":[{"given":"Andreas C.","family":"Nearchou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sotiris L.","family":"Omirou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,14]]},"reference":[{"key":"330_CR1","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker P (2007) Scheduling algorithms, 5th edn. Springer","edition":"5"},{"key":"330_CR2","doi-asserted-by":"crossref","unstructured":"Pinedo ML (2022) Scheduling: theory, algorithms, and systems, Publ. Springer Cham, 6th edition","DOI":"10.1007\/978-3-031-05921-6"},{"issue":"6","key":"330_CR3","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10951-010-0222-9","volume":"14","author":"L M\u00f6nch","year":"2011","unstructured":"M\u00f6nch L, Fowler JW, Dauz\u00e8re-P\u00e9r\u00e8s S, Mason SJ, Rose O (2011) A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. J Sched 14(6):583\u2013599","journal-title":"J Sched"},{"key":"330_CR4","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0377-2217(89)90100-8","volume":"38","author":"T Cheng","year":"1989","unstructured":"Cheng T, Gupta M (1989) Survey of scheduling research involving due date determination decision. Eur J Oper Res 38:156\u2013166","journal-title":"Eur J Oper Res"},{"key":"330_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"K Baker","year":"1990","unstructured":"Baker K, Scudder G (1990) Sequencing with earliness and tardiness penalties: a review. Oper Res 38:22\u201336","journal-title":"Oper Res"},{"key":"330_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"V Gordon","year":"2002","unstructured":"Gordon V, Proth J-M, Chu C (2002) A survey of the state-of-the-art of common due date assignment and scheduling research. Eur J Oper Res 139:1\u201325","journal-title":"Eur J Oper Res"},{"issue":"5\u20136","key":"330_CR7","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.mcm.2003.05.019","volume":"40","author":"V Lauff","year":"2004","unstructured":"Lauff V, Werner F (2004) Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey. Math Comput Model 40(5\u20136):637\u2013655","journal-title":"Math Comput Model"},{"issue":"2","key":"330_CR8","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.ejor.2014.09.043","volume":"242","author":"A Janiak","year":"2015","unstructured":"Janiak A, Janiak WA, Krysiak T, Kwiatkowski T (2015) A survey on scheduling problems with due windows. Eur J Oper Res 242(2):347\u2013357","journal-title":"Eur J Oper Res"},{"key":"330_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106803","volume":"149","author":"GA Rolim","year":"2020","unstructured":"Rolim GA, Nagano MS (2020) Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: a review. Comput Ind Eng 149:106803","journal-title":"Comput Ind Eng"},{"key":"330_CR10","volume-title":"Sequencing and scheduling, an introduction to the mathematics of the job-shop","author":"S French","year":"1990","unstructured":"French S (1990) Sequencing and scheduling, an introduction to the mathematics of the job-shop. Ellis Horwood publication"},{"key":"330_CR11","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1002\/nav.3800280411","volume":"28","author":"JJ Kanet","year":"1981","unstructured":"Kanet JJ (1981) Minimizing the average deviation of job completion times about a common due date. Nav Res Logist 28:643\u2013651","journal-title":"Nav Res Logist"},{"key":"330_CR12","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/nav.3800330206","volume":"33","author":"U Bagchi","year":"1986","unstructured":"Bagchi U, Sullivan RS, Chang YL (1986) Minimizing mean absolute deviation of completion times about a common due-date. Naval Research Logistics Quarterly 33:227\u2013240","journal-title":"Naval Research Logistics Quarterly"},{"key":"330_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/nav.3800330105","volume":"33","author":"N Hall","year":"1986","unstructured":"Hall N (1986) Single and multiple processor models for minimizing completion time variance. Naval Research Logistics Quarterly 33:49\u201354","journal-title":"Naval Research Logistics Quarterly"},{"key":"330_CR14","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1002\/1520-6750(198710)34:5<739::AID-NAV3220340513>3.0.CO;2-3","volume":"34","author":"U Bagchi","year":"1987","unstructured":"Bagchi U, Sullivan RS, Chang YL (1987) Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties about a common due-date. Naval Research Logistics Quarterly 34:739\u2013751","journal-title":"Naval Research Logistics Quarterly"},{"key":"330_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0925-5273(94)90034-5","volume":"34","author":"P De","year":"1994","unstructured":"De P, Ghosh JB, Wells CE (1994) Solving a generalized model for CON due date assignment and sequencing. Int Journal of Production Economics 34:179\u2013185","journal-title":"Int Journal of Production Economics"},{"key":"330_CR16","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1287\/ijoc.9.1.92","volume":"9","author":"JA Hoogeveen","year":"1997","unstructured":"Hoogeveen JA, van de Velde SL (1997) Earliness-tardiness scheduling around almost equal due date. INFORMS J Comput 9:92\u201399","journal-title":"INFORMS J Comput"},{"key":"330_CR17","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/S0305-0548(00)00008-3","volume":"28","author":"D Biskup","year":"2001","unstructured":"Biskup D, Feldmann M (2001) Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates. Comput Oper Res 28:787\u2013801","journal-title":"Comput Oper Res"},{"key":"330_CR18","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/S0360-8352(02)00181-X","volume":"44","author":"M Feldmann","year":"2003","unstructured":"Feldmann M, Biskup D (2003) Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches. Comput Ind Eng 44:307\u2013323","journal-title":"Comput Ind Eng"},{"key":"330_CR19","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0360-8352(94)00197-U","volume":"28","author":"C-Y Lee","year":"1995","unstructured":"Lee C-Y, Kim SJ (1995) Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights. Comput Ind Eng 28:231\u2013248","journal-title":"Comput Ind Eng"},{"key":"330_CR20","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1016\/j.cor.2006.08.013","volume":"35","author":"AC Nearchou","year":"2008","unstructured":"Nearchou AC (2008) A differential evolution approach for the common due date early\/tardy job scheduling problem. Comput Oper Res 35:1329\u20131343","journal-title":"Comput Oper Res"},{"key":"330_CR21","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/0305-0548(95)00051-8","volume":"23","author":"Q Hao","year":"1996","unstructured":"Hao Q, Yang Z, Wang D, Li Z (1996) Common due date determination and sequencing using tabu search. Comput Oper Res 23:409\u2013417","journal-title":"Comput Oper Res"},{"issue":"3","key":"330_CR22","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0305-0548(96)00052-4","volume":"24","author":"RJW James","year":"1997","unstructured":"James RJW (1997) Using tabu search to solve the common due date early\/tardy machine scheduling problem. Comput Oper Res 24(3):199\u2013208","journal-title":"Comput Oper Res"},{"key":"330_CR23","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.cie.2007.01.004","volume":"52","author":"C-J Liao","year":"2007","unstructured":"Liao C-J, Cheng C-C (2007) A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date. Comput Ind Eng 52:404\u2013413","journal-title":"Comput Ind Eng"},{"key":"330_CR24","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.ejor.2004.03.006","volume":"160","author":"CM Hino","year":"2005","unstructured":"Hino CM, Ronconi DP, Mendes AB (2005) Minimizing earliness and tardiness penalties in a single-machine problem with a common due date. Eur J Oper Res 160:190\u2013201","journal-title":"Eur J Oper Res"},{"key":"330_CR25","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ins.2012.11.007","volume":"226","author":"L Le","year":"2013","unstructured":"Le L, Hong Z (2013) Hybridization of harmony search with variable neighborhood search for restrictive single machine earliness\/tardiness problem. Inform Sciences 226:68\u201392","journal-title":"Inform Sciences"},{"key":"330_CR26","doi-asserted-by":"publisher","first-page":"3126","DOI":"10.1016\/j.cor.2005.11.021","volume":"34","author":"R M\u2019Hallah","year":"2007","unstructured":"M\u2019Hallah R (2007) Minimizing total earliness and tardiness on a single machine using a hybrid heuristic. Comput Oper Res 34:3126\u20133142","journal-title":"Comput Oper Res"},{"key":"330_CR27","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution \u2013 a simple and efficient heuristic for global optimization over continuous spaces. Journal Global Optimization 11:341\u2013354","journal-title":"Journal Global Optimization"},{"key":"330_CR28","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1002\/1520-6750(199110)38:5<715::AID-NAV3220380506>3.0.CO;2-6","volume":"38","author":"TCE Cheng","year":"1991","unstructured":"Cheng TCE, Kahlbacher HG (1991) A proof for the longest\/job\/first policy in one\/machine scheduling. Nav Res Logist 38:715\u2013720","journal-title":"Nav Res Logist"},{"key":"330_CR29","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1016\/S0305-0548(03)00116-3","volume":"31","author":"MM Ali","year":"2004","unstructured":"Ali MM, Torn A (2004) Population set-based global optimization algorithms: some modifications and numerical studies. Comput Oper Res 31:1703\u20131725","journal-title":"Comput Oper Res"},{"key":"330_CR30","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.ejor.2004.08.043","volume":"171","author":"P Kaelo","year":"2006","unstructured":"Kaelo P, Ali MM (2006) A numerical study of some modified differential evolution algorithms. Eur J Oper Res 171:674\u2013692","journal-title":"Eur J Oper Res"},{"key":"330_CR31","unstructured":"Zaharie D (2002) Critical values for the control parameters of differential evolution algorithms, In: Matou\u0161ek, Radek and O\u0161mera, Pavel (eds.) (2002). Proc. of MENDEL 2002, 8th Int. Mendel Conference on Soft Computing, Brno, Czech Republic, pp 62\u201367"},{"issue":"6","key":"330_CR32","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1109\/TEVC.2006.872133","volume":"10","author":"J Brest","year":"2006","unstructured":"Brest J, Greiner S, Boskovic B, Mernik M, and. Zumer V, (2006) Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems. IEEE Trans Evol Comput 10(6):646\u2013657","journal-title":"IEEE Trans Evol Comput"},{"key":"330_CR33","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1016\/j.ejor.2006.10.020","volume":"183","author":"A Salman","year":"2007","unstructured":"Salman A, Engelbrecht AP, Omran MGH (2007) Empirical analysis of self-adaptive differential evolution. Eur J Oper Res 183:785\u2013804","journal-title":"Eur J Oper Res"},{"key":"330_CR34","first-page":"831","volume-title":"Proceedings of the IEEE Congress on Evolutionary Computation","author":"H Abbass","year":"2002","unstructured":"Abbass H (2002) The self-adaptive Pareto differential evolution algorithm. Proceedings of the IEEE Congress on Evolutionary Computation. pp 831\u2013836"},{"key":"330_CR35","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan E, Mor\u00e9 J (2002) Benchmarking optimization software with performance profiles. Math Program 91:201\u2013213. https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math Program"},{"key":"330_CR36","doi-asserted-by":"publisher","first-page":"12888","DOI":"10.1007\/s10489-021-03003-z","volume":"52","author":"R Jiang","year":"2022","unstructured":"Jiang R, Zhang J, Tang Y, Feng J, Wang C (2022) Self-adaptive DE algorithm without niching parameters for multi-modal optimization problems. Appl Intell 52:12888\u201312923. https:\/\/doi.org\/10.1007\/s10489-021-03003-z","journal-title":"Appl Intell"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00330-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-024-00330-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00330-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T11:14:12Z","timestamp":1719918852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-024-00330-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,14]]},"references-count":36,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["330"],"URL":"https:\/\/doi.org\/10.1007\/s43069-024-00330-y","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,14]]},"assertion":[{"value":"25 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval and Consent to Participate"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"53"}}