Buscar
Mostrando ítems 1-4 de 4
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
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 ...
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 ...