Buscar
Mostrando ítems 1-2 de 2
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
Linking Scheduling Criteria to Shop Floor Performance in Permutation Flowshops
(MDPI, 2019-12)
The goal of manufacturing scheduling is to allocate a set of jobs to the machines in the shop so these jobs are processed according to a given criterion (or set of criteria). Such criteria are based on properties of the ...