{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,13]],"date-time":"2025-04-13T04:11:31Z","timestamp":1744517491641,"version":"3.40.4"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T00:00:00Z","timestamp":1739923200000},"content-version":"vor","delay-in-days":49,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1016\/j.procs.2025.02.154","type":"journal-article","created":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T12:16:20Z","timestamp":1741695380000},"page":"573-582","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Comparative Analysis of Simulated Annealing and Tabu Search for Parallel Machine Scheduling"],"prefix":"10.1016","volume":"256","author":[{"given":"Alzira","family":"Mota","sequence":"first","affiliation":[]},{"given":"Paulo","family":"\u00c1vila","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o","family":"Bastos","sequence":"additional","affiliation":[]},{"given":"Lu\u00eds A.C.","family":"Roque","sequence":"additional","affiliation":[]},{"given":"Ant\u00f3nio","family":"Pires","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2025.02.154_bib1","unstructured":"P. \u00c1vila e G. Putnik, \u201cImproving Manufacturing Enterprises Resources Utilization,\u201d International Journal of Business Excellence, vol. 9, n\u00ba 3, pp. 265-270, 2016."},{"key":"10.1016\/j.procs.2025.02.154_bib2","doi-asserted-by":"crossref","unstructured":"A. Madureira, I. Pereira, N. Sousa, P. \u00c1vila e J. Bastos, \u201cScheduling a Cutting and Treatment Stainless Steel Sheet Line with Self-Management Capabilities,\u201d Computational Intelligent for Engineering Systems - Emergent Applications, Series: Intelligent Systems, Control and Automation: Science and Engineering, vol. 46, 2010.","DOI":"10.1007\/978-94-007-0093-2_2"},{"key":"10.1016\/j.procs.2025.02.154_bib3","doi-asserted-by":"crossref","unstructured":"A. M. Al-Shayea, M. Saleh, M. Alatefi e M. Ghaleb, \u201cScheduling Two Identical Parallel Machines Subjected to Release Times, Delivery Times and Unavailability Constraints,\u201d Processes, vol. 8, n\u00ba 1025, 2020.","DOI":"10.3390\/pr8091025"},{"key":"10.1016\/j.procs.2025.02.154_bib4","doi-asserted-by":"crossref","unstructured":"G. Wan e B. P. C. Yen, \u201cSingle machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs,\u201d European Journal of Operational Research, vol. 195, pp. 89-97, 2009.","DOI":"10.1016\/j.ejor.2008.01.029"},{"key":"10.1016\/j.procs.2025.02.154_bib5","doi-asserted-by":"crossref","unstructured":"I. S. Lee, \u201cA Scheduling Problem to Minimize Total Weighted Tardiness in the Two-Stage Assembly Flowshop,\u201d Mathematical problems in Engineering, vol. 2020, 2020.","DOI":"10.1155\/2020\/9723439"},{"key":"10.1016\/j.procs.2025.02.154_bib6","doi-asserted-by":"crossref","unstructured":"N. Tyagi, R. P. Tripathi e A. B. Chandramouli, \u201cSingle Machine Scheduling Model with Total Tardiness Problem,\u201d Indian Journal of Science and Technology, vol. 9, n\u00ba 37, 2016.","DOI":"10.17485\/ijst\/2016\/v9i37\/97527"},{"key":"10.1016\/j.procs.2025.02.154_bib7","doi-asserted-by":"crossref","unstructured":"R. Mazzini e V. A. Armentano, \u201cA heuristic for single machine scheduling with early and tardy costs,\u201d European Journal of Operational Research, vol. 128, pp. 129-146, 2001.","DOI":"10.1016\/S0377-2217(99)00345-8"},{"key":"10.1016\/j.procs.2025.02.154_bib8","doi-asserted-by":"crossref","unstructured":"V. Sridharan e Z. Zhou, \u201cA decision theory based scheduling procedure for single machine weighted earliness and tardiness problems,\u201d European Journal of Operational Research, vol. 94, pp. 292-301, 1996.","DOI":"10.1016\/0377-2217(96)00133-6"},{"key":"10.1016\/j.procs.2025.02.154_bib9","doi-asserted-by":"crossref","unstructured":"U. Y. S. Browne, \u201cScheduling Deteriorating Jobs on a Single Processor,\u201d Operations Research, vol. 38, pp. 495-498, 1990.","DOI":"10.1287\/opre.38.3.495"},{"key":"10.1016\/j.procs.2025.02.154_bib10","doi-asserted-by":"crossref","unstructured":"Y. Hoon e M. Pinedo, \u201cTheory and Methodology Scheduling jobs on parallel machines with sequence-dependent setup times,\u201d European Journal of Operation Research, vol. 100, n\u00ba 3, pp. 464-474, 1997.","DOI":"10.1016\/S0377-2217(95)00376-2"},{"key":"10.1016\/j.procs.2025.02.154_bib11","doi-asserted-by":"crossref","unstructured":"K. Li, S.-L. Yang e H.-W. Ma, \u201cA simulated annealing approach to minimize the maximum lateness on uniform parallel machines,\u201d Mathematical and Computer modelling, vol. 53, n\u00ba 5-6, pp. 854-860, 2011.","DOI":"10.1016\/j.mcm.2010.10.022"},{"key":"10.1016\/j.procs.2025.02.154_bib12","doi-asserted-by":"crossref","unstructured":"N. Sekkal e F. Belkaid, \u201cA multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints,\u201d Journal of Combinatorial Optimization, vol. 40, p. 660\u2013696, 2020.","DOI":"10.1007\/s10878-020-00607-y"},{"key":"10.1016\/j.procs.2025.02.154_bib13","doi-asserted-by":"crossref","unstructured":"\u00dc. Bilge, F. K\u0131ra\u00e7, M. Kurtulan e P. Pekg\u00fcn, \u201cA tabu search algorithm for parallel machine total tardiness problem,\u201d Computers & Operations Research, vol. 31, pp. 397-414, 2004.","DOI":"10.1016\/S0305-0548(02)00198-3"},{"key":"10.1016\/j.procs.2025.02.154_bib14","doi-asserted-by":"crossref","unstructured":"S.-I. Kim, H.-S. Choi e D.-H. Lee, \u201cTabu Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready Times,\u201d Computational Science and Its Applications - ICCSA, pp. 728-737, 2006.","DOI":"10.1007\/11751595_77"},{"key":"10.1016\/j.procs.2025.02.154_bib15","unstructured":"D. S. Y. V. A. Armentano, \u201cTabu search for scheduling on identical parallel machines to minimize mean tardiness,\u201d Journal of Intelligent Manufacturing, vol. 11, p. 453\u2013460, 2000."},{"key":"10.1016\/j.procs.2025.02.154_bib16","unstructured":"M. Asghari e S. Nezhadali, \u201cFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness\/Earliness and Flow time through Genetic Algorithm,\u201d Journal of Optimization in Industrial Engineering, vol. 20, pp. 19-30, 2016."},{"key":"10.1016\/j.procs.2025.02.154_bib17","doi-asserted-by":"crossref","unstructured":"M. M. Mazdeh, F. Zaerpour, A. Zareei e A. Hajinezhad, \u201cParallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs,\u201d Applied Mathematical Modeling, vol. 34, pp. 1498-1510, 2010.","DOI":"10.1016\/j.apm.2009.08.023"},{"key":"10.1016\/j.procs.2025.02.154_bib18","doi-asserted-by":"crossref","unstructured":"T. J. Ross, Fuzzy logic with Engineering, Third Edit ed., L. John Wiley & Sons (ed.), 2010.","DOI":"10.1002\/9781119994374"},{"key":"10.1016\/j.procs.2025.02.154_bib19","doi-asserted-by":"crossref","unstructured":"K. Miettinen, Nonlinear Multiobjective Optimization, 1 ed., vol. 12, S. US, Ed., International Series in Operations Research & Management Science, 1998.","DOI":"10.1007\/978-1-4615-5563-6"},{"key":"10.1016\/j.procs.2025.02.154_bib20","doi-asserted-by":"crossref","unstructured":"S. Kirkpatrick, C. Gelett e M. Vecchi, \u201cOptimization by simulated annealing,\u201d vol. 220, pp. 621-630, 1983.","DOI":"10.1126\/science.220.4598.671"},{"key":"10.1016\/j.procs.2025.02.154_bib21","doi-asserted-by":"crossref","unstructured":"V. Cerny, \u201cA thermodynamic approach to the traveling salesman problem: An efficient simulation,\u201d vol. 45, pp. 41-51, 1985.","DOI":"10.1007\/BF00940812"},{"key":"10.1016\/j.procs.2025.02.154_bib22","doi-asserted-by":"crossref","unstructured":"A. Mota, P. \u00c1vila, R. Albuquerque, L. Costa e J. Bastos, \u201cA Framework for Time-Cost-Quality Optimization in Project Management Problems Using an Exploratory Grid Concept in the Multi-Objective Simulated-Annealing,\u201d International Journal of Information Technology & Decision Making, vol. 20, n\u00ba 4, pp. 1095-1120, 2021.","DOI":"10.1142\/S0219622021500322"},{"key":"10.1016\/j.procs.2025.02.154_bib23","doi-asserted-by":"crossref","unstructured":"F. W. Glover, \u201cFuture Paths for Integer Programming and Links to Artificial Intelligence,\u201d Computers and Operations Research, vol. 13, n\u00ba 5, p. 533\u2013549, 1986.","DOI":"10.1016\/0305-0548(86)90048-1"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925005113?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925005113?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,4,12]],"date-time":"2025-04-12T23:02:18Z","timestamp":1744498938000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050925005113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":23,"alternative-id":["S1877050925005113"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2025.02.154","relation":{},"ISSN":["1877-0509"],"issn-type":[{"type":"print","value":"1877-0509"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Comparative Analysis of Simulated Annealing and Tabu Search for Parallel Machine Scheduling","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2025.02.154","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}