{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:30:54Z","timestamp":1764977454883,"version":"3.46.0"},"reference-count":25,"publisher":"Walter de Gruyter GmbH","issue":"3","license":[{"start":{"date-parts":[[2016,7,12]],"date-time":"2016-07-12T00:00:00Z","timestamp":1468281600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,7,26]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>This paper presents a mathematically enhanced genetic algorithm (MEGA) using the mathematical properties of the single-machine scheduling of multiple jobs with a common due date. The objective of the problem is to minimize the sum of earliness and tardiness penalty costs in order to encourage the completion time of each job as close as possible to the common due date. The importance of the problem is derived from its NP-hardness and its ideal modeling of just-in-time concept. This philosophy becomes very significant in modern manufacturing and service systems, where policy makers emphasize that a job should be completed as close as possible to its due date. That is to avoid inventory costs and loss of customer\u2019s goodwill. Five mathematical properties are identified and integrated into a genetic algorithm search process to avoid premature convergence, reduce computational effort, and produce high-quality solutions. The computational results demonstrate the significant impact of the introduced properties on the efficiency and effectiveness of MEGA and its competitiveness to state-of-the-art approaches.<\/jats:p>","DOI":"10.1515\/jisys-2016-0063","type":"journal-article","created":{"date-parts":[[2016,7,12]],"date-time":"2016-07-12T05:14:19Z","timestamp":1468300459000},"page":"531-543","source":"Crossref","is-referenced-by-count":3,"title":["New Properties for Solving the Single-Machine Scheduling Problem with Early\/Tardy Jobs"],"prefix":"10.1515","volume":"26","author":[{"given":"Hemmak","family":"Allaoua","sequence":"first","affiliation":[{"name":"Computer Science Department , University of Bejaia , 06000 Bejaia , Algeria"}]},{"given":"Bouderah","family":"Brahim","sequence":"additional","affiliation":[{"name":"Computer Science Department , University of M\u2019sila , M\u2019sila , Algeria"}]}],"member":"374","published-online":{"date-parts":[[2016,7,12]]},"reference":[{"key":"2025120523272193267_j_jisys-2016-0063_ref_001_w2aab3b7d470b1b6b1ab2ab1Aa","doi-asserted-by":"crossref","unstructured":"R. Alvarez-Valdes, E. Crespo, J. M. Tamarit and F. Villa, Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models, TOP20 (2012), 754\u2013767.","DOI":"10.1007\/s11750-010-0163-7"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_002_w2aab3b7d470b1b6b1ab2ab2Aa","doi-asserted-by":"crossref","unstructured":"A. Awasthi, J. Lassig and O. Kramer, Common due-date problem: exact polynomial algorithms for a given job sequence, 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. Data Structures and Algorithms (cs.DS); Combinatorics (math.CO). Timisoara, Romania (2013).","DOI":"10.1109\/SYNASC.2013.41"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_003_w2aab3b7d470b1b6b1ab2ab3Aa","unstructured":"K. R. Baker and G. D. Scudder, Scheduling with earliness and tardiness penalties: a review, Eur. J. Oper. Res.160 (2005), 190\u2013201."},{"key":"2025120523272193267_j_jisys-2016-0063_ref_004_w2aab3b7d470b1b6b1ab2ab4Aa","doi-asserted-by":"crossref","unstructured":"K. R. Baker and G. D. Scudder, Minimizing earliness and tardiness costs in stochastic scheduling, Eur. J. Oper. Res.236 (2013), 445\u2013452.","DOI":"10.1016\/j.ejor.2013.12.011"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_005_w2aab3b7d470b1b6b1ab2ab5Aa","doi-asserted-by":"crossref","unstructured":"D. Biskup, Single-machine scheduling with learning considerations, Eur. J. Oper. Res.115 (1999), 173\u2013178.","DOI":"10.1016\/S0377-2217(98)00246-X"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_006_w2aab3b7d470b1b6b1ab2ab6Aa","unstructured":"C. N. Cha, S. Lim and Y. K. Jeong, Single-machine job scheduling about a common due date with arbitrary earliness\/tardiness penalties using a genetic algorithm, Asia Pacific Management Review7 (2002), 239\u2013254."},{"key":"2025120523272193267_j_jisys-2016-0063_ref_007_w2aab3b7d470b1b6b1ab2ab7Aa","doi-asserted-by":"crossref","unstructured":"M. Feldman and D. Biskup, Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates, Comput. Ind. Eng.28 (2001), 787\u2013801.","DOI":"10.1016\/S0305-0548(00)00008-3"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_008_w2aab3b7d470b1b6b1ab2ab8Aa","doi-asserted-by":"crossref","unstructured":"M. Feldman and D. Biskup, Single-machine scheduling for minimizing earliness and tardiness penalties by meat-heuristic approaches, Comput. Ind. Eng.44 (2003), 307\u2013323.","DOI":"10.1016\/S0360-8352(02)00181-X"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_009_w2aab3b7d470b1b6b1ab2ab9Aa","doi-asserted-by":"crossref","unstructured":"V. Gordon, J. M. Proth and C. Chu, Invited review: A survey of the state-of-the-art of common due date assignment and scheduling research, Eur. J. Oper. Res.139 (2002), 1\u201325.","DOI":"10.1016\/S0377-2217(01)00181-3"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_010_w2aab3b7d470b1b6b1ab2ac10Aa","doi-asserted-by":"crossref","unstructured":"R. Hassin and M. Shani, Machine scheduling with earliness and tardiness and non-execution penalties, Comput. Ind. Eng.32 (2005), 683\u2013705.","DOI":"10.1016\/j.cor.2003.08.012"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_011_w2aab3b7d470b1b6b1ab2ac11Aa","unstructured":"A. Hemmak and B. Bouderah, Hybrid algorithm for optimization problems applied to single machine scheduling, Int J. Comput. Appl.66 (2013), 7\u201311."},{"key":"2025120523272193267_j_jisys-2016-0063_ref_012_w2aab3b7d470b1b6b1ab2ac12Aa","unstructured":"A. Hemmak and B. Bouderah, Sieve algorithm \u2013 a new method for optimization problems, Int. J. Advance. Soft Comput. Appl.5 (2013), 1\u201315."},{"key":"2025120523272193267_j_jisys-2016-0063_ref_013_w2aab3b7d470b1b6b1ab2ac13Aa","unstructured":"A. Hemmak and B. Bouderah, A mono crossover genetic algorithm for TSP, Global J. Tech.7 (2015), 109\u2013115."},{"key":"2025120523272193267_j_jisys-2016-0063_ref_014_w2aab3b7d470b1b6b1ab2ac14Aa","doi-asserted-by":"crossref","unstructured":"A. Hemmak and I. H. Osman, Variable parameters lengths genetic algorithm for minimizing earliness-tardiness penalties of single machine scheduling with a common due date, Electron. Notes Discrete Math.36 (2010), 471\u2013478.","DOI":"10.1016\/j.endm.2010.05.060"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_015_w2aab3b7d470b1b6b1ab2ac15Aa","doi-asserted-by":"crossref","unstructured":"C. M. Hino, D. P. Ronconi and A. B. Mendes, Minimizing earliness and tardiness penalties in a single machine problem with a common due date, Eur. J. Oper. Res.160 (2005), 190\u2013201.","DOI":"10.1016\/j.ejor.2004.03.006"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_016_w2aab3b7d470b1b6b1ab2ac16Aa","doi-asserted-by":"crossref","unstructured":"A. Jafarnejad, S. M. Abtahi and S. M. R. Davoodi, Optimizing the earliness and tardiness penalties in the single-machine scheduling problems with focus on the just in time, Int. J. Acad. Res. Bus. Soc. Sci.3 (2013), 315\u2013322.","DOI":"10.6007\/IJARBSS\/v3-i7\/55"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_017_w2aab3b7d470b1b6b1ab2ac17Aa","doi-asserted-by":"crossref","unstructured":"J. Lassig, A. Awasthi and O. Kramer, Common due-date problem: linear algorithm for a given job sequence, in: 2014 IEEE 17th International Conference on Computational Science and Engineering, University of Electronic Science and Technology of China, 2014.","DOI":"10.1109\/CSE.2014.51"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_018_w2aab3b7d470b1b6b1ab2ac18Aa","doi-asserted-by":"crossref","unstructured":"C. J. Liao and C. C. Cheng, A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date, Comput. Ind. Eng.52 (2007), 404\u2013413.","DOI":"10.1016\/j.cie.2007.01.004"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_019_w2aab3b7d470b1b6b1ab2ac19Aa","doi-asserted-by":"crossref","unstructured":"S. W. Lin, S. Y. Chou and K. C. Ying, A sequential exchange approach for minimizing earliness-tardiness penalties of single machine scheduling with a common due date, Eur. J. Oper. Res.177 (2007), 1294\u20131301.","DOI":"10.1016\/j.ejor.2005.11.015"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_020_w2aab3b7d470b1b6b1ab2ac20Aa","doi-asserted-by":"crossref","unstructured":"A. C. Nearchou, A differential evolution approach for the common due date early\/tardy job scheduling problem, Comput. Oper. Res.35 (2008), 1329\u20131343.","DOI":"10.1016\/j.cor.2006.08.013"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_021_w2aab3b7d470b1b6b1ab2ac21Aa","doi-asserted-by":"crossref","unstructured":"Z. Ning, C. Tao and L. Fei, A hybrid heuristic algorithm for the intelligent transportation scheduling problem of the BRT system, J. Intell. Syst.24 (2015), 437\u2013448.","DOI":"10.1515\/jisys-2014-0134"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_022_w2aab3b7d470b1b6b1ab2ac22Aa","doi-asserted-by":"crossref","unstructured":"D. P. Ronconi and M. S. Kawamura, The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm, Comput. Appl. Math.29 (2010), 107\u2013124.","DOI":"10.1590\/S1807-03022010000200002"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_023_w2aab3b7d470b1b6b1ab2ac23Aa","doi-asserted-by":"crossref","unstructured":"M. Shahriari, N. Shoja, A. E. Zade, S. Barak and M. Sharifi, JIT single machine scheduling problem with periodic preventive maintenance, J. Ind. Eng. Int. (2016), 1\u201312.","DOI":"10.1007\/s40092-016-0147-9"},{"key":"2025120523272193267_j_jisys-2016-0063_ref_024_w2aab3b7d470b1b6b1ab2ac24Aa","unstructured":"T. Vall\u00e9e and M. Yiltizogli, Pr\u00e9sentation des algorithmes g\u00e9n\u00e9tiques et leurs applications en \u00e9conomie, Mai5 (2004), Rapport technique."},{"key":"2025120523272193267_j_jisys-2016-0063_ref_025_w2aab3b7d470b1b6b1ab2ac25Aa","doi-asserted-by":"crossref","unstructured":"K. C. Ying, Minimizing earliness-tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm, Comput. Ind. Eng.55 (2008), 494\u2013502.","DOI":"10.1016\/j.cie.2008.01.008"}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jisys\/26\/3\/article-p531.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2016-0063\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2016-0063\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:28:19Z","timestamp":1764977299000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2016-0063\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,12]]},"references-count":25,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2016,5,11]]},"published-print":{"date-parts":[[2017,7,26]]}},"alternative-id":["10.1515\/jisys-2016-0063"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2016-0063","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"type":"electronic","value":"2191-026X"},{"type":"print","value":"0334-1860"}],"subject":[],"published":{"date-parts":[[2016,7,12]]}}}