The two-machine ow-shop serial-batching scheduling problem with limited batch sizeReportar como inadecuado




The two-machine ow-shop serial-batching scheduling problem with limited batch size - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 LAMSADE - Laboratoire d-analyse et modélisation de systèmes pour l-aide à la décision 2 OASIS - Optimisation des systèmes industriels et de services Tunis 3 ENIT - Ecole Nationale d-Ingénieurs de Tunis

Abstract : We consider the the two-machine ow-shop serial-batching scheduling problem where the batches have limited size. Two criteria are considered here. The rst criterion is to minimize the number of batches. This criterion re ects situations where processing of any batch induces a xed cost, which leads to a total cost proportional to the number of batches. The second criterion is the makespan. We study the complexity of the problem and propose polynomial-time algorithms for some particular cases and an approximation algorithm with a guaranteed performance for the general case.





Autor: Mohamed Ali Aloulou - Afef Bouzaiene - Najoua Dridi - Daniel Vanderpooten -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados