Buscar
Mostrando ítems 1-6 de 6
Artículo
Constructive and composite heuristics for the 2-stage assembly scheduling problem with periodic maintenance and makespan objective
(Elsevier, 2022-11-15)
This paper addresses the 2-stage assembly scheduling problem to minimise makespan with availability constraints, where the machines are not always available due to periodic maintenance activities. To the best of our ...
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
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 ...
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 ...
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 the usual assumption of machine availability presented in most research, we consider that machines may ...