{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:26:46Z","timestamp":1747654006055},"reference-count":34,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0305-0548(94)90022-1","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"941-954","source":"Crossref","is-referenced-by-count":3,"title":["Genetic search with dynamic operating disciplines"],"prefix":"10.1016","volume":"21","author":[{"given":"S.","family":"Yeralan","sequence":"first","affiliation":[]},{"given":"C.-S.","family":"Lin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90022-1_BIB1","series-title":"Adaptation in natural and artificial systems","author":"Holland","year":"1975"},{"key":"10.1016\/0305-0548(94)90022-1_BIB2","series-title":"Principles of Genetics","author":"Sinnott","year":"1950"},{"key":"10.1016\/0305-0548(94)90022-1_BIB3","first-page":"46","article-title":"Genetic algorithms: What computers can learn from Darwin","volume":"92","author":"Walbridge","year":"1989","journal-title":"Technol. Rev."},{"key":"10.1016\/0305-0548(94)90022-1_BIB4","series-title":"A Connectionist Machine for Genetic Hillclimbins","author":"Ackley","year":"1987"},{"key":"10.1016\/0305-0548(94)90022-1_BIB5","volume":"Volume 1","author":"Barr","year":"1981"},{"key":"10.1016\/0305-0548(94)90022-1_BIB6","series-title":"Genetic Algorithms and Simulated Annealing","article-title":"Improving search in genetic algorithms","author":"Booker","year":"1987"},{"key":"10.1016\/0305-0548(94)90022-1_BIB7","series-title":"Proceeding of the Third International Conference on Genetic Algorithms. Morgan Kaufmann","article-title":"Adapting operator probabilities in genetic algorithms","author":"Davis","year":"1989"},{"key":"10.1016\/0305-0548(94)90022-1_BIB8","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/0305-0548(94)90022-1_BIB9","series-title":"Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann","article-title":"Distributed genetic algorithms","author":"Tanese","year":"1989"},{"key":"10.1016\/0305-0548(94)90022-1_BIB10","first-page":"361","article-title":"Genetic algorithms","volume":"16","author":"Wayner","year":"1991","journal-title":"Byte"},{"key":"10.1016\/0305-0548(94)90022-1_BIB11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/09528139008953723","article-title":"GENITOR II: a distributed genetic algorithm","volume":"2","author":"Whitley","year":"1990","journal-title":"J. Experimental Theoretical Artificial Intelligence"},{"key":"10.1016\/0305-0548(94)90022-1_BIB12","series-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/0305-0548(94)90022-1_BIB13","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/nav.3800310214","article-title":"Minimizing the sum of absolute lateness in single-machine and multimachine scheduling","volume":"31","author":"Sundararaghavan","year":"1984","journal-title":"Naval Res. logist. Q."},{"key":"10.1016\/0305-0548(94)90022-1_BIB14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/mnsc.35.2.177","article-title":"The single machine early\/tardy problem","volume":"35","author":"Ow","year":"1989","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90022-1_BIB15","article-title":"An analysis of the behavior of a class of genetic adaptive systems","author":"DeJong","year":"1975"},{"key":"10.1016\/0305-0548(94)90022-1_BIB16","article-title":"Optimization of control parameters for genetic algorithms","volume":"SMC-16","author":"Grefenstette","year":"1986","journal-title":"IEEE Trans, syst. man, and Cybernet."},{"key":"10.1016\/0305-0548(94)90022-1_BIB17","doi-asserted-by":"crossref","unstructured":"J. Sidney, Optimal single-machine scheduling with earliness and tardiness penalties. Ops Res.25, 62\u201369 (9177).","DOI":"10.1287\/opre.25.1.62"},{"key":"10.1016\/0305-0548(94)90022-1_BIB18","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1287\/opre.26.6.1079","article-title":"Optimal single-machine scheduling with earliness and tardiness penalties","volume":"26","author":"Lakshminarayan","year":"1978","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90022-1_BIB19","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1002\/nav.3800280411","article-title":"Minimizing the average deviation of job completion times about a common duedate","volume":"28","author":"Kanet","year":"1981","journal-title":"Naval Res. logist. Q."},{"key":"10.1016\/0305-0548(94)90022-1_BIB20","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/nav.3800330105","article-title":"Single and multiple processor models for minimizing completion time variance","volume":"33","author":"Hall","year":"1986","journal-title":"Naval Res. logist. Q."},{"key":"10.1016\/0305-0548(94)90022-1_BIB21","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/nav.3800330206","article-title":"Minimizing mean absolute deviation of completion times about a common due date","volume":"33","author":"Bagchi","year":"1986","journal-title":"Naval Res. logist. Q."},{"key":"10.1016\/0305-0548(94)90022-1_BIB22","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1287\/mnsc.33.7.894","article-title":"Minimizing mean absolute and squared deviation of completion times with different earliness and tardiness penalties and a common due date","volume":"33","author":"Bagchi","year":"1987","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90022-1_BIB23","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1002\/1520-6750(198712)34:6<803::AID-NAV3220340605>3.0.CO;2-2","article-title":"Scheduling a common due date on parallel common processors","volume":"34","author":"Emmons","year":"1987","journal-title":"Naval Res. logist. Q."},{"key":"10.1016\/0305-0548(94)90022-1_BIB24","first-page":"663","article-title":"Single machine scheduling to minimize absolute deviation of completion times from a common due date","volume":"26","author":"Azwarc","year":"1989","journal-title":"Naval Res. logist. Q."},{"key":"10.1016\/0305-0548(94)90022-1_BIB25","article-title":"Algorithm for minimizing earliness and tardiness penalty with a common due date","author":"Baker","year":"1989"},{"key":"10.1016\/0305-0548(94)90022-1_BIB26","article-title":"Scheduling to minimize weighted absolute deviations","author":"Fry","year":"1984"},{"key":"10.1016\/0305-0548(94)90022-1_BIB27","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1080\/07408178708975418","article-title":"Minimizing weighted absolute deviation in single machine scheduling","volume":"19","author":"Fry","year":"1987","journal-title":"IIE Trans."},{"key":"10.1016\/0305-0548(94)90022-1_BIB28","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","article-title":"One processor scheduling with symmetric earliness and tardiness penalties","volume":"13","author":"Garey","year":"1988","journal-title":"Maths Ops Res."},{"key":"10.1016\/0305-0548(94)90022-1_BIB29","first-page":"1","article-title":"Algorithms for a class of single-machine weighted tardiness and earliness problems","volume":"51","author":"Yano","year":"1989","journal-title":"Europ. J. Op. Res."},{"key":"10.1016\/0305-0548(94)90022-1_BIB30","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties: a review","volume":"38","author":"Baker","year":"1990","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90022-1_BIB31","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/nav.3800180304","article-title":"A hybrid algorithm for the one machine sequencing problem to minimize total tardiness","volume":"18","author":"Srinivasan","year":"1971","journal-title":"Naval Res. logist. Q."},{"key":"10.1016\/0305-0548(94)90022-1_BIB32","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/05695557108974812","article-title":"An improved method for scheduling independent tasks","volume":"5","author":"Wilkerson","year":"1971","journal-title":"AIIE Trans."},{"key":"10.1016\/0305-0548(94)90022-1_BIB33","series-title":"Probability and Statistics in Engineering and Management Science","author":"Hines","year":"1980"},{"key":"10.1016\/0305-0548(94)90022-1_BIB34","series-title":"Genetic Algorithms and their Applications","article-title":"An adaptive crossover distribution mechanism for genetic algorithms","author":"Shafer","year":"1987"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900221?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900221?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T10:22:10Z","timestamp":1585045330000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":34,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0305054894900221"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90022-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}