İki paralel enjeksiyon makinasının kreyn kısıtı altında çizelgelenmesi

Bu çalışmada iki paralel enjeksiyon makinasının kreyn kısıtı altında çizelgelenmesi problemi ele alınmıştır. Enjeksiyon makinalarıyla üretimin hazırlık aşamasında, üretilecek ürüne ait kalıbın makinaya bağlanması gerekmektedir. Kalıplar ilgili makinalara kreyn ile taşınmaktadır. Makinalar tek bir kreyni paylaştığı için hazırlık zamanları çakışmamalıdır. Ayrıca bir işin hazırlık zamanı kendisinden önceki işe bağlı olarak farklılık göstermektedir ve her iş her makinada üretilememektedir. Amaç, son işin tamamlanma zamanının en küçüklenmesidir. Bu nedenle problem P2, S| STsd, Mj | Cenb sınıfında yer almaktadır. Ele alınan problem için bir matematiksel model önerilmiştir. Ayrıca problemin NP-zor problemler sınıfında yer alması nedeniyle büyük boyutlu problemlerin çözümü için bir genetik algoritma geliştirilmiştir. Önerilen algoritmanın başarısı rassal türetilen test problemleri kullanılarak matematiksel model ve elde edilen alt sınırlar üzerinden gösterilmiştir.

Two parallel injection machine scheduling under crane constraint

In this study, two parallel injection machine scheduling problem under crane constraint is considered.In setup phase of production with injection machine, the mold of the product is fixed to the machine.Molds are transported by a crane to relative machine. The crane is shared by two machines so setup times should not overlap. In addition, the problem has sequence dependent setup times and machine eligibility constraints. The objective is minimization of the makespan. So, class of the problem is P2, S1| STsd, Mj | Cmax. A mathematical model was proposed for the problemand due to, the problem is in the class of NPhard problems, a genetic algorithm is developed for solving large size problems. The success of the algorithm is shown by using randomly generated instances through mathematical model and lower bounds.

PDF

___

Allahverdi A., Gupta J.N., Aldowaisan T., A review of scheduling research involving setup considerations, Omega, 27 (2), 219- 239, 1999.
Allahverdi A., Mg C.T., Cheng T.C., Kovalyov M.Y., A survey of scheduling problems with setup time sor costs, European Journal of Operational Research, 187 (3), 985- 1032, 2008.
Türker A.K., Sel Ç., A hybrit approach on single server parallel machines scheduling problem with sequence dependent setup times, Journal of the Faculty of Engineering and Architecture of Gazi University, 26 (4) 731- 740, 2011.
Huang S., Cai L., Zhang X., Parallel dedicated machine scheduling problem with sequence-dependent setups and a single server, Computers & Operations Research, 58 (1), 165- 174, 2010.
Kravchenko S.A., Werner F., Parallel Machine Scheduling Problems with a Single Server, Mathematical and Computer Modelling, 26 (12), 1- 11,1997.
Gan H., Wirth A., Abdekhodaee A., A branch-and- price algorithm for the general case of scheduling parallel machines with a single server, Computers & Operations Research, 39 (9), 2242- 2247, 2012.
Kim M., Lee Y.H., MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server, Computers & Operations Research, 39 (11), 2457-2468, 2012.
Zhang L., Wirth A., On-line scheduling of two parallel machines with a single server, Computers & Operations Research, 36 (5), 1529-1553, 2009.
Hasani K., Kravchenko S.A., Werner, F., Block models for scheduling jobs on two parallel machines with a single server, Computers & Operations Research, 41, 94- 97, 2014.
Abdekhodaee A.H., Wirth A., Scheduling parallel machines with a single server: some solvable cases and heuristics, Computers & Operations Research, 29 (3), 295- 315, 2002.
Jiang Y., Dong J., Ji M., Preemptive scheduling on two parallel machines with a single server, Computers & Industrial Engineering, 66 (2), 514- 518, 2013.
Hall N.G., Potts C.N., Sriskandarajah C., Parallel machine scheduling with a common server, Discrete Applied Mathematics,102 (3), 223- 243, 2000.
Edis E.B., Oğuz C., Özkarahan İ., Solution approaches for simultaneous schedulinf of jobs and operators on parallel machines, Journal of the Faculty of Engineering and Architecture of Gazi University, 27 (3), 527- 535, 2012.
Saraç T., Genelleştirilmiş karesel çoklu sırt çantası problemi için melez bir çözüm yaklaşımı, Doktora Tezi, Eskişehir Osmangazi Üniversitesi, Fen Bilimleri Enstitüsü., Eskişehir, 2007.
Bean J.C., Genetic algorithms and random keys for sequencing and optimization, ORSA J. Comput. 6, 154-160, 1994.
Joo C.M., Kim B.S., Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability, Computers & Industrial Engineering, 85, 102- 109, 2015.
Kim M., Lee Y.H., MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server, Computers & Operations Research, 39 (11), 2457- 2468, 2012.
Pinedo M.L., Scheduling theory, algorithms and systems, Springer, New York, 3, 111- 142, 2008.