Buscar
Mostrando ítems 21-30 de 37
Artículo
A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
(Taylor & Francis, 2014)
As the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an increasing need to provide efficient algorithms for this type of decision problems, characterised by ...
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 ...
Artículo
New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics
(Elsevier, 2018)
This paper addresses the hybrid flow shop scheduling problem to minimise makespan, a well-known scheduling problem for which many constructive heuristics have been proposed in the literature. Nevertheless, the state of the ...
Artículo
New hard benchmark for the 2-stage multi-machine assembly scheduling problem: Design and computational evaluation
(Elsevier, 2021-08)
The assembly scheduling problem is a common layout with many applications in real manufacturing scenarios. Despite the high number of studies dealing with this problem, no benchmark has been proposed up-to-now in the ...
Artículo
Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation
(Elsevier, 2022-06)
In this paper, we address the assembly flowshop scheduling problem, which is a generalisation of two well-known scheduling problems in the literature: the three-stage Assembly Scheduling Problem (ASP) and its variant with ...
Artículo
A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
(Taylor & Francis, 2017)
Makespan minimization in permutation flow-shop scheduling is an operations research topic that has been intensively addressed during the last 40 years. Since the problem is known to be NP-hard for more than two machines, ...
Ponencia
Artículo
A common framework and taxonomy for multicriteria scheduling problems with Interfering and competing Jobs: Multi-agent scheduling problems
(2014)
Most classical scheduling research assumes that the objectives sought are common to all jobs to be scheduled. However, many real-life applications can be modeled by considering different sets of jobs, each one with its ...
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
Deterministic Assembly Scheduling Problems: A Review and Classification of Concurrent-Type Scheduling Models and Solution Procedures
(Elsevier, 2019-03)
Many activities in industry and services require the scheduling of tasks that can be concurrently executed, the most clear example being perhaps the assembly of products carried out in manufacturing. Although numerous ...