İş Bağımlı Öğrenme Etkili Çizelgelemede Ortak Teslim Tarihinden Toplam Erken/Geç Tamamlanma Cezalarının En Küçüklenmesi

Yıl 2011, Cilt: 27 Sayı: 4, 325 - 331, 01.08.2011

Mesut Cemil İşler Bilal Toklu Veli Çelik

Öz

Erken/Geç (E/G) tamamlanma problemi, önceleri literatürde ağırlıklandırılmış mutlak sapma problemi olarak bilinmekteydi. Hem erken hem de geç tamamlanma zamanı çizelgeleme problemlerinde önemli ölçütlerdir. Toplam gecikme ölçütü teslim tarihlerine uyuma ilişkin göstergeleri sağlarken (erken tamamlanan işlere ilişkin sonuçları göz ardı ederek), sadece geç tamamlanan işlerin cezaları ile ilgilenir. Ancak bu eğilim tam zamanında üretim (TZÜ) konusuna olan artan ilgi ile birlikte değişmeye başlamıştır. TZÜ’de erken tamamlanma geç tamamlanma kadar önemlidir. Öğrenme etkisi kavramı yöneylem araştırmasının birçok farklı alanında çalışılmıştır. Ancak üretim çizelgeleme ile ilgili sınırlı sayıda çalışma vardır. Bu çalışmada iki makine akış tipi çizelgeleme ortamında iş bağımlı öğrenme etkili ortak teslim tarihinden toplam erken/geç tamamlanma cezalarının en küçüklenmesi problemi ele alınmıştır. Ayrıca, KOBİ’ler için Karar Destek Sistemi (KDS) yaklaşımıyla Microsoft Excel®’de bir arayüz tasarlanmıştır. Bu arayüz KOBİ’lerde benzer çizelgeleme problemleri için kolaylıkla kullanılabilir. Bu arayüz ayrıca farklı çizelgeleme problemine sahip KOBİ’ler için geliştirilebilir ve dönüştürülebilir.

Anahtar Kelimeler

Çizelgeleme, Akış Tipi, Erken/Geç Tamamlanma, Öğrenme Etkisi, Tamsayılı Programlama, Arayüz

Minimizing total earliness/tardiness penalties for common due date with general job-dependent learning effect

Öz

In the literature, Earliness/Tardiness (E/T) problem was known as weighted absolute deviation problem. Both tardiness and earliness are very important performance criteria for scheduling problems. While total tardiness criterion provides adaptation for due date (ignoring results of early performed jobs), it deals with only cost of tardiness. However this phenomenon has been started to change with Just in Time (JIT) production concept. On JIT production, earliness is as important as tardiness. The phenomenon of the learning effect has been extensively studied in many different areas of operational research. However, there have been a few studies in the general context of production scheduling such as flow-shop scheduling. In this paper, we considered the minimization of the total earliness/tardiness penalties from a common due date under general job-dependent learning effects problem on a two-machine flow-shop scheduling environment. Furthermore, an interface at the Microsoft Excel was projected with Decision Support System Approach for Small and Medium Size Enterprises (SME). This interface could be easily used by SMEs, which have similar scheduling problems. This interface can also be improved/transformed for SMEs’ different scheduling problems.

Anahtar Kelimeler

Scheduling, Flow-shop, Earliness/Tardines, Learning Effect, Integer Programming, Interface

Kaynakça

• Iyer S.K. and Saxena B., Improved genetic algorithm for the permutation flowshop scheduling problem, Computers&Operations Research, 31, 593-606, 2004.
• Cheng M.B., Sun S.J. and Yu Y., A note on flow shop scheduling problems with a learning effect on no-idle dominant machines, Applied Mathematics and Computation, 184, 945-949, 2007.
• Biskup D., A state-of-the-art review on scheduling with learning effects, European Journal of Operational Research, 188, 315-329, 2008.
• Wright T.P., Factors affecting the cost of airplanes, Journal of The Aeronautical Sciences, 3, 122-128, 1936.
• Mosheiov G. and Sidney J.B., Scheduling with general job-dependent learning curves, European Journal of Operational Research, 147, 665-670, 2003.
• Biskup D., Single-machine scheduling with learning considerations, European Journal of Operational Research, 115, 173-178, 1999.
• Mosheiov, G., Parallel machine scheduling with learning effect, Journal of The Operational Research Society, 52, 1165-1169, 2001a.
• Mosheiov G. and Sidney J.B., Note on scheduling with general learning curves to minimize number of tardy jobs, Journal of The Operational Research Society, 56, 110112, 2005.
• Lin S.W., Chou S.Y. and Ying K.C., A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date, European Journal of Operational Research, 177, 1294-1301, 2007.
• Eren T. and Güner E., Flowshop scheduling with general job-dependent learning effect, K.H.O. Journal of Defense Sciencesi, (In Turkish), 2, 1-11, 2003.
• Eren T. and Güner E., A bicriteria flowshop scheduling problem with a learning effect, Applied Mathematical Modelling, 32, 1719-1733, 2008.
• Baker K.R., Elements of sequencing and scheduling, Dartmounth College, Hanover, 1997.
• Hino C.S., Ronconi D.P. and Mendes A.B., Minimizing earliness and tardiness penalties in a single-machine problem with a common due date, European Journal of Operational Research, 160, 190-201, 2005.
• Baker K.R. and Scudder G.D., Sequencing with earliness and tardiness penalties: A review, Operations Research, 38 (1), 22-36, 1990.
• Hall N.G., Kubiak W. and Sethi S.P., Earliness–tardiness scheduling problem, II: Deviation of completion times about a restrictive common due date, Operations Research 39 (5), 847–856, 1991.
• Hall N.G. and Posner M.E., Earliness–tardiness scheduling problem, I: Weighted deviation of completion times about a common due date, Operations Research 39 (5), 836–846, 1991.
• Lauff V. and Werner F., Scheduling with Common Due Date, Earliness and Tardiness Penalties for Multimachine Problems: A Survey, Mathematical and Computer Modelling, 40 (5-6), 637-655, 2004.
• Sakuraba C.S., Ronconi D.P. and Sourd F., Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date, Computers&Operations Research, 36 (1), 60-72, 2009.
• Sarper H., Minimizing the sum of absolute deviations about a common due date for the two machine flow shop problem, Applied Mathematical Modelling, 19 (3), 153161, 1995.
• Mosheiov G., Scheduling problems with a learning effect, European Journal of Operational Research, 132, 687-693, 2001b.
• Biskup D. and Simons, D., Common due date scheduling with autonomous and induced learning, European Journal of Operational Research, 159, 606–616, 2004.
• Kuo W.H. and Yang D.L., Single machine scheduling with past-sequence-dependent setup times and learning effects, Information Processing Letters, 102, 22-26, 2007.
• Toksari M.D. and Güner E., Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration, Computers&Operations Research, 36 (8), 2394-2417, 2008.
• Toksari M.D. and Güner E., The common due-date early/tardy scheduling problem on a parallel machine under the effects of time-dependent learning and linear and nonlinear deterioration, Expert Systems with Applications, 37, 92-112, 2010.
• Isler M.C., Celik V. and Toklu B., The minimization of absolute deviation from common due date in two machine Flowshop scheduling with learning effect, (In Turkish), J. Fac. Eng. Arch. Gazi Univ., 24(2), 351-357, 2009.
• Isler M.C., Toklu B., Celik V. and Ersoz S., Just in time scheduling problem with learning effect and application in a “SME”, (In Turkish), Int. J. Eng. Research&Development, 1(2), 29-33, 2009.
• Power D.J., Decision support systems: concepts and resources for managers, Greenwood Publishing Group Inc., USA, 2002.
• Lingo User’s Guide, Lindo Systems Inc., Chicago, IL, 1999.
• Sakallı Ü.S. and Birgören B., A linear programming interface for production planning in casting industry, (In Turkish), YAEM2004, 154-156, 2004.
• İşler M.C., Theoretical and Applied Investigation of Just in Time Flow-shop Scheduling Problem with a Learning Effect in Manufacturing Systems, PhD Science Thesis, Kırıkkale University, 2010.
• Johnson SM., Optimal two and three stage production schedules with set-up times included, Naval Research Logistics Quarterly, 1(1), 61-68, 1954.