Decomposition methods for large job shops

Simple item page
dc.contributor.authorSinger, M
dc.date.accessioned2024-01-10T12:04:49Z
dc.date.available2024-01-10T12:04:49Z
dc.date.issued2001
dc.description.abstractA rolling horizon heuristic is presented for large job shops, in which the total weighted tardiness must be minimized. The method divides a given instance into a number of subproblems, each having to correspond to a time window of the overall schedule, which are solved using a shifting bottleneck heuristic. A number of rules for defining each time window are derived. The method is tested by using instances up to 10 machines and 100 operations per machine, outperforming a shifting bottleneck heuristic that has been shown to generate close to optimal results.
dc.description.abstractScope and purpose
dc.description.abstractThere has been a significant amount of research focused on the scheduling of a job shop, either minimizing the makespan or the tardiness. Although the results for small-size problems are satisfactory, there has been no approach as for yet middle- and large-size problems. This paper presents a heuristic that decomposes the problems on a time window basis, solving each subproblem using a shifting bottleneck heuristic. Its results for a due-date-related objective function are promising. (C) 2000 Elsevier Science Ltd. All rights reserved.
dc.fechaingreso.objetodigital2024-04-11
dc.format.extent15 páginas
dc.fuente.origenWOS
dc.identifier.doi10.1016/S0305-0548(99)00098-2
dc.identifier.eissn1873-765X
dc.identifier.issn0305-0548
dc.identifier.urihttps://doi.org/10.1016/S0305-0548(99)00098-2
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/75889
dc.identifier.wosidWOS:000165349500001
dc.information.autorucEscuela de Administración;Singer M;S/I;77066
dc.issue.numero3
dc.language.isoen
dc.nota.accesocontenido parcial
dc.pagina.final207
dc.pagina.inicio193
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD
dc.revistaCOMPUTERS & OPERATIONS RESEARCH
dc.rightsacceso restringido
dc.subjectscheduling
dc.subjectjob shop
dc.subjectrolling horizon
dc.subjectSHIFTING BOTTLENECK PROCEDURE
dc.subjectSCHEDULING PROBLEM
dc.subjectWEIGHTED TARDINESS
dc.subjectALGORITHM
dc.subjectSEARCH
dc.subject.ods12 Responsible Consumption and Production
dc.subject.odspa12 Producción y consumo responsable
dc.titleDecomposition methods for large job shops
dc.typeartículo
dc.volumen28
sipa.codpersvinculados77066
sipa.indexWOS
sipa.trazabilidadCarga SIPA;09-01-2024
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Decomposition methods for large job shops.pdf
Size:
2.28 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Artículos de revistas