Buscar
Mostrando ítems 1-10 de 22
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, ∑CWTj. Both measures are relevant indicators of the efficiency of production systems, since they are ...
Artículo
New efficient constructive heuristics for the two-stage multi-machine assembly scheduling problem
(Elsevier, 2020-02)
In this paper, we address the two-stage multi-machine assembly scheduling problem, a layout consisting of several dedicated parallel machines in the first stage and identical parallel machines in the second stage. The ...
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 manufacturing companies due to Information Technologies initiatives such as Smart Factory or Industry 4.0, ...
Artículo
Single machine scheduling with periodic machine availability
(Elsevier Ltd, 2018-09)
In this paper we address the problem of scheduling jobs on a single machine with cyclical machine availability periods. In this problem, the scheduling horizon is composed of periods where the machine is available followed ...
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 ...
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
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
Single machine scheduling with periodic machine availability
(Elsevier, 2018-09)
In this paper we address the problem of scheduling jobs on a single machine with cyclical machine availability periods. In this problem, the scheduling horizon is composed of periods where the machine is available followed ...
Artículo
Permutation flowshop scheduling with periodic maintenance and makespan objective
(Elsevier, 2020-05)
In this paper, we address the permutation flowshop scheduling problem with cyclical unavailability periods where no operation can be processed. Under this constraint, all machines must stop at the same time due to the shift ...