Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Felipe T. Muñoz"'
Autor:
Felipe T. Muñoz, Rodrigo Linfati
Publikováno v:
Mathematics, Vol 12, Iss 14, p 2223 (2024)
This article investigates the performance of the Weighted Shortest Processing Time (WSPT) rule as a local sequencing policy in a scheduling game for uniformly related parallel machines, where the social objective is the total weighted completion time
Externí odkaz:
https://doaj.org/article/5452b9bfc6ad4a15922f68cc0a96eda1
Publikováno v:
Mathematics, Vol 12, Iss 1, p 6 (2023)
This study investigates the worst-case performance guarantee of locally optimal solutions to minimize the total weighted completion time on uniformly related parallel machines. The investigated neighborhood structure is Jump, also called insertion or
Externí odkaz:
https://doaj.org/article/716580950a8e45358a527d10d4ae3fbb
Publikováno v:
Ingenieria Industrial, Vol 8, Iss 1 (2009)
Este trabajo presenta un modelo de planificación agregada para la optimización de la producción e instalación de una empresa fabricadora de Muros Cortina, también llamados Sistemas de Fachada Ligera. Este producto está compuesto por una estruct
Externí odkaz:
https://doaj.org/article/f5282f70afb1447c8ca9a8629c36251c
Autor:
Felipe T. Muñoz, Alejandro A. Pinochet
Publikováno v:
RAIRO - Operations Research. 56:1079-1088
We study the worst case performance guarantee of locally optimal solutions for the problem of scheduling jobs on uniformly related parallel machines with the objective of minimizing the total weighted completion time. The quality of locally optimal s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a12a40addf3ffaa3548071e1ac6d371
https://doi.org/10.1051/ro/2022045
https://doi.org/10.1051/ro/2022045
Autor:
Felipe T. Muñoz, José R. Correa
Publikováno v:
Mathematical Programming. 191:847-869
We study the worst-case performance guarantee of locally optimal solutions for the problem of minimizing the total weighted and unweighted completion time on parallel machine environments. Our method makes use of a mapping that maps a schedule into a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c7b9c7344cc87264b7b6c78692fb47a
https://doi.org/10.1007/s10107-020-01571-5
https://doi.org/10.1007/s10107-020-01571-5
Optimizing Cutting Log Operations in Softwood Sawmills: A Multi-Objective Approach Tailored for SMEs
Publikováno v:
IEEE Access, Vol 12, Pp 128141-128150 (2024)
The production planning problem in the Pinus radiata sawmill industry revolves around determining how to cut a set of logs of different diameters to obtain pieces with a rectangular base, typically of the same length as the original log. The primary
Externí odkaz:
https://doaj.org/article/2c1581ca3bcc48a28c32935e4afbbfc6