Buscar
Mostrando ítems 11-20 de 68
Tesis Doctoral
The permutation flowshop scheduling problem: analysis, solution procedures and problem extensions
(2016-06-27)
During the past twenty five years, following the massive use of internet and the EU single Market, European manufacturing companies struggle in a more competitive market, where firms from different countries must fight for ...
Tesis Doctoral
The impact of supply chain structures on performance.
(2014-02-27)
La Tesis analiza el impacto que tiene la estructura de las redes de suministro sobre su rendimiento, concretamente sobre el “efecto látigo” o efecto bullwhip. Para ello se desarrolla una arquitectura basada en la metodología ...
Ponencia
A review on Decisions Support Systems for Manufacturing Scheduling
(TUM School of Management, 2014)
Ponencia
Two-agent scheduling problem with flowtime objective: Analysis of problem and exact method
(TUM School of Management, 2014)
Artículo
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
(Elsevier, 2019)
In this paper we address the classical hybrid flow shop scheduling problem with makespan objective. As this problem is known to be NP-hard and a very common layout in real-life manufacturing scenarios, many studies have ...
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
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 NEH heuristic and the iterated greedy algorithm – are based on constructing a sequence by iteratively ...
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 arriving to the system together with jobs already present (denoted as old jobs), in order to set a ...
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 with total flowtime minimisation as objective. This well-known problem is NP-hard, and several ...
Artículo
Efficient heuristics for the hybrid flow shop scheduling problem with missing operations
(Elsevier, 2019)
In this paper, we address the hybrid flowshop scheduling problem for makespan minimisation. More specifically, we are interested in the special case where there are missing operations, i.e. some stages are skipped, a ...