Buscar
Mostrando ítems 11-18 de 18
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 ...
Artículo
Reduction of permutation flowshop problems to single machine problems using machine dominance relations
(Elsevier, 2017)
The Permutation Flowshop Scheduling Problem with Makespan objective (PFSP-M) is known to be NP-hard for more than two machines, and literally hundreds of works in the last decades have proposed exact and approximate ...
Ponencia
Artículo
Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
(Elsevier, 2015)
This paper focuses on the problem of scheduling jobs in a permutation flowshop with the objective of makespan minimisation subject to a maximum allowed tardiness for the jobs, a problem that combines two desirable manufacturing ...
Artículo
The distributed permutation flow shop to minimise the total flowtime
(Elsevier Ltd, 2018-04)
In the last years, researchers are paying special attention to scheduling in distributed environments due to the increasing benefits of multi-factory manufacture. In this paper, we address the distributed permutation ...
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 ...
Artículo
Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
(2009)
In this paper, we address the problem of scheduling a set of jobs in a flowshop with makespan objective. In contrast to the usual assumption of machine availability presented in most research, we consider that machines may ...
Artículo
On heuristic solutions for the stochastic flowshop scheduling problem Author links open overlay panel
(Elsevier, 2015)
We address the problem of scheduling jobs in a permutation flowshop when their processing times adopt a given distribution (stochastic flowshop scheduling problem) with the objective of minimization of the expected makespan. ...