Buscar
Mostrando ítems 1-10 de 34
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
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
Exploring the benefits of scheduling with advanced and real-time information integration in Industry 4.0: A computational study
(Elsevier, 2022-05)
The technological advances recently brought to the manufacturing arena (collectively known as Industry 4.0) offer huge possibilities to improve decision-making processes in the shop floor by enabling the integration of ...
Ponencia
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
Permutation flowshop problems with initial availability constraints: Characterisation and Analysis
(ADINGOR ( Asociación para el Desarrollo de la Ingeniería de Organización), 2010)
This paper characterises the initial availability constraint problems in a permutation flowshop layout considering different objectives: makespan, total flowtime and idle time. The goal is to analyse the structure ...
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
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 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
Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times
(Elsevier, 2019-05)
This work considers a scheduling problem identified in a factory producing customised Heating, Ventilation and Air Conditioning (HVAC) equipment. More specifically, the metal folding section is modelled as unrelated parallel ...