Buscar
Mostrando ítems 1-10 de 134
The Non-Permutation Flow-Shop scheduling problem: A literature review
(Pergamon-Elsevier Science Ltd, 2018-06)
The Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the job order on different machines. The flexibility that ...
Path-based Metaheuristics to Solve A Variant of the Flowshop ProblemMetaheurísticas Basadas en Trayectoria para Resolver una Variante del Problema de Flowshop
(Universidad Tecnológica Nacional, 2019)
Lower bounding schemes for flowshops with blocking in-process
(Palgrave Publishers LtdBasingstokeInglaterra, 2001)
Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions
(Taylor & Francis LtdAbingdonInglaterra, 2006)
A Constructive Genetic Algorithm for permutation flowshop scheduling
(PERGAMON-ELSEVIER SCIENCE LTD, 2008)
The general flowshop scheduling problem is a production problem where a set of n jobs have to be processed with identical flow pattern on in machines. In permutation flowshops the sequence of jobs is the same on all machines. ...
Some heuristic algorithms for total tardiness minimization in a flowshop with blocking
(PERGAMON-ELSEVIER SCIENCE LTD, 2009)
The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines: therefore intermediate queues of jobs waiting in the system for ...
A hybrid scheduling approach for automated flowshops with material handling and time constraints
(Taylor & Francis, 2014-01)
Flowshop scheduling problems have been extensively studied by several authors using different approaches. A typical flowshop process consists of successive manufacturing stages arranged in a single production line where ...
A non-permutation flowshop scheduling problem with lot streaming: A mathematical model
(Growing Science, 2016-06)
In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted ...
Genetic local search for multi-objective flowshop scheduling problems
(Elsevier Science BvAmsterdamHolanda, 2005)