Ara
Toplam kayıt 18, listelenen: 1-10
Öğrenme etkili hazırlık ve taşıma zamanlı paralel makineli çizelgeleme problemi
(2006)
Çizelgeleme problemleri ile ilgili yapılan çalışmalarda, işlerin hazırlık ve taşıma zamanları genellikle ya ihmal edilmiş yada işlem zamanlarına dahil edilerek çözüm yaklaşımları geliştirilmiştir. Ancak, bazı üretim ...
Farklı geliş zamanlı öğrenme etkili paralel makineli çizelgeleme problemi
(2008)
Bu çalışmada m-özdeş paralel makineli çizelgeleme problemi farklı geliş zamanlı durumda incelenecektir. Problemin amaç fonksiyonu maksimum tamamlanma zamanı enküçüklemektir. NP-zor yapıda olan bu problemin çözümü için, ...
Paralel makineli çizelgelemede toplam tamamlanma zamanı ve maksimum gecikmenin enküçüklenmesi
(2006)
Bu çalışmada iki ölçütlü özdeş iki paralel makineli çizelgeleme problemi incelenmiştir. Problemin amaç fonksiyonu toplam tamamlanma zamanı ve maksimum gecikmenin ağırlıklı toplamını en küçüklemektir. Tamamlanma zamanı ve ...
Minimizing the maximum lateness in a scheduling problem with a time-dependent learning effect: A non-linear programming model
(Gazi Univ, Fac Engineering Architecture, 2008)
In traditional scheduling problems, most literature assumes that the processing time of a job is fixed. However, there are many situations where the processing time of a job depends on the starting time or the position of ...
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 ...