Buscar
Mostrando ítems 1-2 de 2
Artículo
A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
(Taylor & Francis, 2017)
Makespan minimization in permutation flow-shop scheduling is an operations research topic that has been intensively addressed during the last 40 years. Since the problem is known to be NP-hard for more than two machines, ...
Artículo
Sequencing CONWIP flow-shops: Analysis and heuristics
(Taylor & Francis, 2010)
In this paper, we address the backlog sequencing problem in a flow-shop controlled by a CONWIP production control system, with the objective to minimize the makespan. We characterize the problem and analyse its similarities ...