Buscar
Mostrando ítems 1-4 de 4
Artículo
NEH-based heuristics for the permutation flowshop scheduling problem to minimize total tardiness
(Elsevier, 2015)
Since Johnson׳s seminal paper in 1954, scheduling jobs in a permutation flowshop has been receiving the attention of hundreds of practitioners and researchers, being one of the most studied topics in the Operations Research ...
Artículo
A new set of high-performing heuristics to minimize flowtime in permutation flowshops
(Elsevier, 2015)
This paper addresses the problem of scheduling jobs in a permutation flowshop with the objective of total completion time minimisation. Since this problem is known to be NP-hard, most research has focussed on obtaining ...
Artículo
Controllable Processing Times in Project and Production Management: Analysing the trade-off between processing times and the amount of resources
(Hindawi, 2015)
The amount of resources assigned to a task highly influences its processing time. Traditionally, different functions have been used in the literature in order to map the processing time of the task with the amount of ...
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 ...