Ara
Toplam kayıt 18, listelenen: 1-10
Maximum completion time under a learning effect in the permutation flowshop scheduling problem
(Univ Cincinnati Industrial Engineering, 2018)
The permutation flowshop scheduling problem under a position-based learning effect is addressed in this study. Minimization of the maximum completion time (make span) is considered for the identified problem. The mathematical ...
The single machine scheduling problem with sequence-dependent setup times and a learning effect on processing times
(Elsevier Science Bv, 2018)
For the past few years, learning effect has been receiving wide attention in the scheduling problems. There are many studies that take into account the learning effect with several structural constraints and some specific ...
A bicriteria parallel machine scheduling with a learning effect of setup and removal times
(Elsevier Science Inc, 2009)
In studies oil scheduling problems, generally setup times and removal times of jobs have been neglected or by including those into processing times. However, in some production systems, setup times and removal times are ...
A bicriteria parallel machine scheduling with a learning effect
(Springer London Ltd, 2009)
Conventionally, job processing times are assumed to be constant from the first job to be processed until the last job to be completed. However, recent empirical studies in several industries have verified that unit costs ...
A note on minimizing maximum lateness in an m-machine scheduling problem with a learning effect
(Elsevier Science Inc, 2009)
Conventionally, job processing times are assumed to be constant from the first job to be processed until the last job to be completed. However, recent empirical studies in several industries have verified that unit costs ...
Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
(Elsevier Science Inc, 2009)
In this study, single machine scheduling problem with unequal release dates and a learning effect is considered. The objective function of the problem is minimization of the total weighted completion time. A non-linear ...
A bicriteria flowshop scheduling problem with setup times
(Elsevier Science Inc, 2006)
Most of research in production scheduling is concerned with the minimization of a single criterion. However, scheduling problems often involve more than one aspect and therefore require bicriteria analysis. In this study, ...
A bicriteria scheduling with sequence-dependent setup times
(Elsevier Science Inc, 2006)
In this paper a bicriteria scheduling problem with sequence-dependent setup times on a single machine is considered. The objective function of the problem is minimization of the weighted sum of total completion time and ...
A multicriteria flowshop scheduling problem with setup times
(Elsevier Science Sa, 2007)
Most of research in production scheduling is concerned with the minimization of a single criterion. However, scheduling problems often involve more than one aspect and therefore require multicriteria analysis. In this ...
A bicriteria scheduling problem with a learning effect: Total completion time and total tardiness
(Taylor & Francis Inc, 2007)
This paper considers a bicriteria scheduling problem with a learning effect on a single machine to minimize a weighted sum of total completion time and total tardiness. A mathematical programming model is developed for the ...