{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T00:21:31Z","timestamp":1771460491729,"version":"3.50.1"},"reference-count":32,"publisher":"Elsevier BV","issue":"7-8","license":[{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"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 & Operations Research"],"published-print":{"date-parts":[[1998,7]]},"DOI":"10.1016\/s0305-0548(97)00097-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:00:05Z","timestamp":1027652405000},"page":"625-635","source":"Crossref","is-referenced-by-count":22,"title":["A composite heuristic for the single machine early\/tardy job scheduling problem"],"prefix":"10.1016","volume":"25","author":[{"given":"Maria Teresa","family":"Almeida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\u00e1rio","family":"Centeno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(97)00097-X_BIB1","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1016\/0377-2217(94)00213-4","article-title":"An SA\/Ts mixture algorithm for the scheduling tardiness problem","volume":"88","author":"Adenso-Diaz","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1057\/jors.1988.26","article-title":"Dynamic programming state-space relaxation for single-machine scheduling","volume":"39","author":"Abdul-Razaq","year":"1988","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB3","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":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB4","unstructured":"Centeno, M., M\u00e9todos Heur\u0131\u0301sticos para o Problema de Escalonamento de Tarefas numa M\u00e1quina com Custos de Antecipa\u00e7\u00e3o e Atraso, M.Sc. Dissertation, Instituto Superior de Economia e Gest\u00e3o-Universidade T\u00e9cnica de Lisboa, Lisboa, 1993"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB5","unstructured":"Centeno, M. and Almeida, M. T., Solu\u00e7\u00f5es Aproximadas para um Problema de Escalonamento numa M\u00e1quina: Algoritmos construtivos. Working-Paper CEMAPRE 2\/94, Instituto Superior de Economia e Gest\u00e3o-Universidade T\u00e9cnica de Lisboa, 1994"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB6","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1287\/opre.40.3.596","article-title":"A single machine model for determination of optimal due dates and sequence","volume":"40","author":"Chand","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB7","unstructured":"Davis, J. S. and Kanet, J. J., Single machine scheduling with early and tardy completion costs. Working-Paper, Clemson University, 1988"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB8","unstructured":"French, S., Sequencing and scheduling, an introduction to the mathematics of the job-shop, Ellis Horwood, 1990"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB9","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":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB10","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2013 Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB11","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search \u2013 Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02078647","article-title":"A users guide to tabu search","volume":"41","author":"Glover","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB13","unstructured":"Glover, F. and Laguna, M., Tabu search. In Modern Heuristic Techniques for Combinatorial Problems, ed. C. Reeves, Blackwell Scientific Publications, 1993"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB14","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M., Taillard, E. and de Werra, D. (eds.), Tabu search, Annals of Operations Research 41, J. C. Baltzer AG, 1993","DOI":"10.1007\/BF02078647"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB15","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1287\/opre.39.5.847","article-title":"Earliness\u2013tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB16","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","article-title":"Earliness\u2013tardiness scheduling problems, I: Weighted deviation of completion times about a common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB17","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: An experimental evaluation; part I graph partitioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB18","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","article-title":"Optimization by simulated annealing: An experimental evaluation; part II graph coloring and number partitioning","volume":"39","author":"Johnson","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB19","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0377-2217(93)90181-L","article-title":"Scheduling with monotonous earliness and tardiness penalties","volume":"64","author":"Kahlbacher","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB20","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB21","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":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB22","doi-asserted-by":"crossref","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G. and Shmoys, D. B., Sequencing and scheduling: Algorithms and complexity. In Logistics of Production and Inventory, Handbooks in Operations Research and Management Science 4, North-Holland, 1993","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB23","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0305-0548(97)00097-X_BIB24","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0305-0548(93)90066-R","article-title":"A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions","volume":"20","author":"Mittenthal","year":"1993","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB25","unstructured":"Morton, T. E. and Pentico, D. W., Heuristic Scheduling Systems with Applications to Production Systems and Project Management, John Wiley and Sons, 1993"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB26","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0305-0548(90)90001-N","article-title":"The application of the simulated annealing algorithm to the solution of the n\/m\/Cmax flowshop problem","volume":"17","author":"Ogbu","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB27","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":"Management Science"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB28","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1057\/jors.1987.58","article-title":"A generalized model of optimal due date assignment by linear programming","volume":"38","author":"Quaddus","year":"1987","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB29","unstructured":"Reeves, C. (ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, 1993"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB30","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1287\/opre.25.1.62","article-title":"Optimal single machine scheduling with earliness and tardiness penalties","volume":"25","author":"Sidney","year":"1977","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB31","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01586059","article-title":"A time indexed formulation of non-preemptive single machine scheduling problems","volume":"54","author":"Sousa","year":"1992","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(97)00097-X_BIB32","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Job scheduling by simulated annealing","volume":"40","author":"Van Laarhoven","year":"1992","journal-title":"Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505489700097X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505489700097X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:25:13Z","timestamp":1580883913000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030505489700097X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,7]]},"references-count":32,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[1998,7]]}},"alternative-id":["S030505489700097X"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(97)00097-x","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1998,7]]}}}