Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A dispatching algorithm for flexible job-shop scheduling with transfer batches: an industrial application

Autor
Calleja, G.; Pastor, Rafael
Tipus d'activitat
Article en revista
Revista
Production planning and control
Data de publicació
2013-05-03
Volum
25
Número
2
Pàgina inicial
93
Pàgina final
109
DOI
https://doi.org/10.1080/09537287.2013.782846 Obrir en finestra nova
URL
http://www.tandfonline.com/doi/full/10.1080/09537287.2013.782846#.UvJGsrTKpKm Obrir en finestra nova
Resum
In this study, we present a dispatching algorithm to solve a real-world case of the flexible job-shop scheduling problem with transfer batches and the objective of minimising the average tardiness of production orders. The proposed algorithm considers two variants: (i) an ordered variant, where the priority dispatching rules are applied in a predefined order, and (ii) a randomised variant, where the user can assign probabilities (weights) to the priority rules. Using the information of the numbe...
Paraules clau
Dispatching Algorithm, Flexible Job-shop Scheduling Problem, Transfer Batches
Grup de recerca
OPE-PROTHIUS - Organització de la Producció en Tallers Híbrids
SCOM - Supply Chain and Operations Management

Participants