Buradasınız

Anasayfa » Content

PARALEL MAKİNELERDE İŞLERİN VE MAKİNE OPERATÖRLERİNİN BİRLİKTE ÇİZELGELENMESİ PROBLEMİNE ÇÖZÜM YAKLAŞIMLARI

SOLUTION APPROACHES FOR SIMULTANEOUS SCHEDULING OF JOBS AND OPERATORS ON PARALLEL MACHINES

Journal Name:

  • Gazi Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi

Publication Year:

  • 2012

Key Words:

Keywords (Original Language):

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
In literature, most of the studies related to parallel machine scheduling problems assume that jobs require only machines as the processing resources and accordingly deal with simply job-machine scheduling problem. However, in real-life manufacturing environments, jobs may also require additional resources. A common example of additional resources is cross-training workers that perform tasks related with different machines. This study handles a real-life problem that requires simultaneous scheduling of jobs and operators over the parallel machines. Operators are responsible for monitoring the machines, unloading the parts and trimming extra material. These tasks may not require an operator’s full attention during the processing of a job at one machine. In this context, a significant distinguishing feature of the investigated problem is that an operator can be assigned to more than one machine through the specified time periods. While determining the machines that an operator has to deal with during the same scheduling periods, the physical closeness of the machines should also be taken into account. For the problem on hand, with the aim of minimizing the completion time of the last job, integer and constraint programming models have been developed. The models have been evaluated through the test problems with different parameters, and their performances have been discussed. Finally, the applicability of the proposed constraint programming model on the real-life problem has been shown.
Bookmark/Search this post with
Abstract (Original Language): 
Literatürde ele alınan paralel makine çizelgeleme problemlerinin çoğunluğu, işlerin ihtiyaç duyduğu tek kaynağın makine olduğu varsayımına dayanır ve yalnızca iş-makine çizelgeleme problemi ile ilgilenir. Oysa gerçek yaşam problemlerinde işler, makineler dışındaki ek kaynaklara da gereksinim duymaktadır. Ek kaynakların en çok karşılaşılan örneği, farklı makinelerde farklı işlerle çalışabilme yeteneğine sahip olan makine operatörleridir. Bu çalışmada işlerin ve operatörlerin paralel makineler boyunca çizelgelenmesini gerektiren bir gerçek yaşam problemi ele alınmıştır. Operatörler, makineleri izlemek, ürünleri çıkarmak, ürün üzerindeki fazlalıkları almak vb. işlemlerle sorumludur. Bu işlemler, herhangi bir ürünün işlenme süresinin tamamı boyunca bir operatörün makine başında durmasını gerektirmeyebilir. Bu kapsamda, ele alınan problemin yazındaki benzer çalışmalardan önemli bir farkı; bir operatörün belli zaman dilimleri boyunca birden fazla makineye atanabilmesi özelliğidir. Operatörün aynı zaman diliminde ilgileneceği makineler belirlenirken, makinelerin fiziksel yakınlıkları da dikkate alınmalıdır. Ele alınan problem için en son işin bitiş süresini en küçükleme amaçlı tamsayı ve kısıt programlama modelleri geliştirilmiştir. Geliştirilen modeller, farklı parametreler içeren test problemlerine uygulanmış ve performansları değerlendirilmiştir. Son olarak, kısıt programlama modelinin gerçek yaşam problemine uygulanabilirliği gösterilmiştir.
FULL TEXT (PDF): 
PDF icon arastirmax-paralel-makinelerde-islerin-makine-operatorlerinin-birlikte-cizelgelenmesi-problemine-cozum-yaklasimlari.pdf
  • 3
527
535
  • Turkish

REFERENCES

References: 

1. Pinedo M., Scheduling: Theory, Algorithms,
and Systems, 2. basım, Prentice-Hall,
Englewood-Cliffs, NJ, A.B.D., 2002.
2. Ventura, J.A. ve Kim, D., “Parallel machine
scheduling with earliness-tardiness penalties and
additional resource constraints”, Computers &
Operations Research, Cilt 30, 1945–1958, 2003.
3. Daniels, R.L., Hua, S.Y., ve Webster, S.,
“Heuristics for Parallel-Machine Flexible-
Resource Scheduling Problems with Unspecified
Job Assignment”, Computers & Operations
Research, Cilt 26, 143-155, 1999.
4. Edis, E.B., Oğuz, C. ve Özkarahan, İ., “Paralel
Makinelerde İşlerin ve Makine Operatörlerinin
Birlikte Çizelgelenmesi Problemine Çözüm
Yaklaşımları”, Yöneylem Araştırması ve
Endüstri Mühendisliği 30. Ulusal Kongresi
Bildiri Özetleri Kitabı, Sabancı Üniversitesi,
İstanbul, 338, 30 Haziran-2 Temmuz 2010.
5. Edis, E.B., “Resource Constrained Parallel
Machine Scheduling Problems with Machine
Eligibility Restrictions: Mathematical and
Constraint Programming Based Approaches”,
Doktora Tezi, Dokuz Eylül Üniversitesi, Fen
Bilimleri Enstitüsü, Ocak 2010.
6. Daniels, R.L., Hoopes, B.J. ve Mazzola J.B.,
“Scheduling Parallel Manufacturing Cells with
Resource Flexibility”, Management Science,
Cilt 42, No 9, 1260-1276, 1996.
7. Chen, Z., “Simultaneous Job Scheduling and
Resource Allocation on Parallel Machines”,
Annals of Operations Research, Cilt 129, 135–
153, 1999.
8. Grigoriev, A., Sviridenko, M. ve Uetz, M., “LP
rounding and an almost harmonic algorithm for
scheduling with resource dependent processing
times”, Lecture Notes in Computer Science,
Cilt 4110, Editörler: Diaz, J., Jansen, K., Rolim,
J. ve Zwick, U., Springer-Verlag, Berlin,
Almanya, 140-151, 2006.
9. Grigoriev, A., Sviridenko, M. ve Uetz, M.,
“Machine scheduling with resource dependent
processing times”, Mathematical Programming
Series B, Cilt 110, 209-228, 2007.
10. Grigoriev, A., Sviridenko, M. ve Uetz, M.,
“Unrelated parallel machine scheduling with
resource dependent processing times”, Lecture
Notes in Computer Science, Cilt 3509,
Editörler: Jünger, M. ve Kaibel V., Springer-
Verlag, Berlin, Almanya, 182-195, 2005.
11. Hu, P.C., “Minimising Total Tardiness for the
Worker Assignment Scheduling Problem in
Identical Parallel-Machine Models”,
International Journal of Advanced
Manufacturing Technology, Cilt 23, No 5–6,
383–388, 2004.
12. Hu, P.C., “Minimizing Total Flow Time for the
Worker Assignment Scheduling Problem in the
Identical Parallel-Machine Models”,
International Journal of Advanced
Manufacturing Technology, Cilt 25, No 9–10,
1046–1052, 2005.
13. Chaudry, I.A. ve Drake, P.R., “Minimizing total
tardiness for the machine scheduling and worker
assignment problems in identical paralel
machines using genetic algorithms”,
International Journal of Advanced
Manufacturing Technology, Cilt 42, 581–594,
2009.
14. Chaudry, I.A., “Minimizing flow time for the
worker assignment problem in identical parallel
machine models using GA”, International
Journal of Advanced Manufacturing
Technology, Cilt 48, 747–760, 2010.
15. Edis, E.B, Araz, C. ve Ozkarahan, I.
"Lagrangian-Based Solution Approaches for a
Resource-Constrained Parallel Machine
Scheduling Problem with Machine Eligibility
Restrictions", Lecture Notes in Computer
Science, Cilt 5027, Editörler: Nguyen, N.T. vd.,
Springer-Verlag, Berlin, Almanya, 337-346,
2008.
16. Edis, E. B. ve Ozkarahan, I. “A combined
integer/constraint programming approach to a
resource-constrained parallel machine scheduling
problem with machine eligibility restrictions”,
Engineering Optimization, Cilt 43, No 2, 135-
157, 2011.
17. Edis, E.B. ve Ozkarahan, I. "Solution Approaches
for a Real Life Resource Constrained Parallel
Machine Scheduling Problem", International
Journal of Advanced Manufacturing
Technology, Cilt 58, No 9-12, 1141-1153, 2012.
18. Bourland, K.E. ve Carl, L.K., “Parallel machine
scheduling with fractional operator
requirements”, IIE Transactions, Cilt 26, No 5,
56-65, 1994.
19. Zouba, M, Baptiste, P. ve Rebaine, D.,
“Scheduling identical parallel machines and
operators within a period based changing mode”,
Computers & Operations Research, Cilt 36,
3231-3239, 2009.
20. Garey, M.R. ve Johnson, D.S., Computers and
Intractability: A Guide to the Theory of NPCompleteness,
W. H. Freeman and Company,
A.B.D., 1979.
21. Darbi-Dowman, K.D., Little, J., Mitra, G. ve
Zaffalon, M., “Constraint Logic Programming
and Integer Programming Approaches and Their
Collaboration in Solving an Assignment
Scheduling Problem”, Constraints, Cilt 1, 245-
264, 1997.
22. Smith, B.M., Brailsford, S.C., Hubbard, P.M. ve
Williams, H.P., “The Progressive Party Problem:
Integer Linear Programming and Constraint
Programming Compared”, Constraints, Cilt 1,
119-138, 1997.
Paralel Makinelerde İşlerin ve Makine Operatörlerinin Birlikte Çizelgelenmesi Problemine Çözüm Yaklaşımları E. B. Edis ve ark.
Gazi Üniv. Müh. Mim. Fak. Der. Cilt 27, No 3, 2012 535
23. Darbi-Dowman, K.D. ve Little, J., “Properties of
Some Combinatorial Optimization Problems and
Their Effect on the Performance of Integer
Programming and Constraint Logic
Programming”, Informs Journal on
Computing, Cilt 10, No 3, 276-286, 1998.
24. Lustig, I.J. ve Puget J.F., “Program Does Not
Equal Program: Constraint Programming and Its
Relationship to Mathematical Programming”,
Interfaces, Cilt 31, No 6, 29-53, 2001.
25. IBM, ILOG OPL IDE 6.3., User’s Manual,
IBM Corp., 2009.
26. McNaughton, R., “Scheduling with deadlines and
loss functions”, Management Science, Cilt 6, No
1, 1-12, 1959.
27. Li, Y., Wang, F. ve Lim A., “Resource
constraints machine scheduling: A genetic
algorithm approach”, CEC: 2003 Congress on
Evolutionary Computation, Cilt 1-4, 1080-
1085, 2003.

Thank you for copying data from http://www.arastirmax.com