Buscar
Mostrando ítems 1-1 de 1
Artículo
New approximate algorithms for the customer order scheduling problem with total completion time objective
(Elsevier, 2017-02)
In this paper, we study a customer order scheduling problem where a number of orders, composed of several product types, have to be scheduled on a set of parallel machines, each one capable to process a single product type. ...