Buscar
Mostrando ítems 1-2 de 2
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. ...
Artículo
The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic
(Elsevier, 2017-12)
In this paper, we address the 2-stage assembly scheduling problem where there are m machines in the first stage to manufacture the components of a product and one assembly station (machine) in the second stage. The objective ...