Ara
Toplam kayıt 4, listelenen: 1-4
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 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 ...
Minimizing total tardiness in a scheduling problem with a learning effect
(Elsevier Science Inc, 2007)
Minimizing of total tardiness is one of the most studied topics on single machine problems. Researchers develop a number of optimizing and heuristic methods to solve this NP-hard problem. In this paper, the problem of ...