Mostrar el registro sencillo del ítem
dc.contributor.author | Beldar, Pedram | es_ES |
dc.contributor.author | Moghtader, Milad | es_ES |
dc.contributor.author | Giret Boggino, Adriana Susana | es_ES |
dc.contributor.author | Ansaripoord, Amir Hossein | es_ES |
dc.date.accessioned | 2023-10-05T18:01:36Z | |
dc.date.available | 2023-10-05T18:01:36Z | |
dc.date.issued | 2022-06 | es_ES |
dc.identifier.issn | 0360-8352 | es_ES |
dc.identifier.uri | http://hdl.handle.net/10251/197768 | |
dc.description.abstract | [EN] Combination of job scheduling and maintenance activity has been widely investigated in the literature. We consider a non-identical parallel machines batch processing (BP) problem with release dates, due dates and variable maintenance activity to minimize total tardiness. An original mixed integer linear programming (MILP) model is formulated to provide an optimal solution. As the problem under investigation is known to be strongly NP-hard, two meta-heuristic approaches based on Simulated Annealing (SA) and Variable Neighborhood Search (VNS) are developed. A constructive heuristic method (H) is proposed to generate initial feasible solutions for the SA and VNS. In order to evaluate the results of the proposed solution approaches, a set of instances were randomly generated. Moreover, we compare the performance of our proposed approaches against four meta heuristic algorithms adopted from the literature. The obtained results indicate that the proposed solution methods have a competitive behaviour and they outperform the other meta-heuristics in most instances. Although in all cases, H + SA is the most performing algorithm compared to the others. | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | Elsevier | es_ES |
dc.relation.ispartof | Computers & Industrial Engineering | es_ES |
dc.rights | Reserva de todos los derechos | es_ES |
dc.subject | Minimization of total tardiness | es_ES |
dc.subject | Parallel machines | es_ES |
dc.subject | Batch processing machines | es_ES |
dc.subject | Scheduling with maintenance activity | es_ES |
dc.subject.classification | LENGUAJES Y SISTEMAS INFORMATICOS | es_ES |
dc.title | Non-identical parallel machines batch processing problem with release dates, due dates and variable maintenance activity to minimize total tardiness | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1016/j.cie.2022.108135 | es_ES |
dc.rights.accessRights | Abierto | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Escuela Técnica Superior de Ingeniería del Diseño - Escola Tècnica Superior d'Enginyeria del Disseny | es_ES |
dc.description.bibliographicCitation | Beldar, P.; Moghtader, M.; Giret Boggino, AS.; Ansaripoord, AH. (2022). Non-identical parallel machines batch processing problem with release dates, due dates and variable maintenance activity to minimize total tardiness. Computers & Industrial Engineering. 168:1-28. https://doi.org/10.1016/j.cie.2022.108135 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | https://doi.org/10.1016/j.cie.2022.108135 | es_ES |
dc.description.upvformatpinicio | 1 | es_ES |
dc.description.upvformatpfin | 28 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 168 | es_ES |
dc.relation.pasarela | S\482103 | es_ES |
dc.contributor.funder | Universitat Politècnica de València | es_ES |