Buscar
Mostrando ítems 1-3 de 3
Tesis Doctoral
The permutation flowshop scheduling problem: analysis, solution procedures and problem extensions
(2016-06-27)
During the past twenty five years, following the massive use of internet and the EU single Market, European manufacturing companies struggle in a more competitive market, where firms from different countries must fight for ...
Artículo
A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimize total flowtime
(Elsevier, 2016)
This paper focuses on the blocking flow shop scheduling problem with the objective of total flowtime minimisation. This problem assumes that there are no buffers between machines and, due to its application to many ...
Artículo
Efficient constructive and composite heuristics for the Permutation Flowshop to minimise total earliness and tardiness
(Elsevier, 2016)
In this paper we address the problem of scheduling jobs in a permutation flowshop with a just-in-time objective, i.e. the minimisation of the sum of total tardiness and total earliness. Since the problem is NP-hard, there ...