ListarArtículos (Organización Industrial y Gestión de Empresas I) por materia "Flowshop"
Mostrando ítems 1-17 de 17
-
Artículo
A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
(Elsevier, 2017)In this paper we present a beam-search-based constructive heuristic to solve the permutation flowshop scheduling problem ...
-
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 ...
-
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 ...
-
Artículo
A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
(Elsevier, 2017)The permutation flowshop problem is a classic machine scheduling problem where n jobs must be processed on a set of m ...
-
Artículo
Comparison of heuristics for rescheduling in permutation flowshops
(ADINGOR, 2009)Rescheduling is one of the main consequences of the variability in the shop floor, as a number of unforeseeable disruptions ...
-
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 ...
-
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 ...
-
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 ...
-
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 ...
-
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 ...
-
Artículo
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
(Elsevier, 2014-05)The most efficient approximate procedures so far for the flowshop scheduling problem with makespan objective – i.e. the ...
-
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 ...
-
Artículo
Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
(Elsevier, 2020-09)This paper focuses on two components of idle time and waiting time, namely core idle time, ∑CITi, and core waiting time, ...
-
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 ...
-
Artículo
Setting a common due date in a constrained flowshop: A variable neighbourhood search approach
(2010)In this paper we study a due date setting problem in a flowshop layout. The problem consists of scheduling a set of jobs ...
-
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 ...
-
Artículo
Using real-time information to reschedule jobs in a flowshop with variable processing times
(Elsevier, 2019-03)In a time where detailed, instantaneous and accurate information on shop-floor status is becoming available in many ...