Model Integer Programming untuk penugasan pekerjaan dengan waktu kedatangan dan keberangkatan yang berbeda

Authors

  • Andre Sugiyono Universitas Islam Sultan Agung
  • Dedy Kurniadi Universitas Islam Sultan Agung

DOI:

https://doi.org/10.26623/transformatika.v20i2.5911

Keywords:

tugas, lokasi, pekerjaan

Abstract

Penelitian  ini membahas masalah alokasi peti kemas ke lokasi galangan terminal kapal dimana peti kemas memiliki waktu kedatangan dan keberangkatan yang berbeda untuk meminimalkan total biaya penanganan peti kemas. Diasumsikan bahwa jika lokasi galangan yang dipilih lebih dekat ke titik dimana peti kemas diturunkan dari kapal, biaya keseluruhan akan berkurang. Masalah ini dapat didefinisikan sebagai masalah alokasi mesin pekerjaan di mana biaya pemrosesan pekerjaan pada setiap mesin berbeda tetapi tidak tergantung pada waktu pemrosesan dan pekerjaan yang tidak dapat diakhiri memiliki waktu kedatangan dan keberangkatan yang berbeda. Masalah ini dirumuskan dalam solusi eksak sebagai model pemrograman integer campuran. Hasil komputasi menunjukkan bahwa heuristik ketiga yang diusulkan efisien dalam memecahkan masalah lokasi dalam biaya yang berbeda, jumlah pekerjaan, dan waktu komputasi.

References

Billionet, A., M. C. Costa, A. Sutter. 1992. An efficient algorithm for a task allocation problem. Journal Assoc. Comput. Machinery 39 502-518.

Chen, W., C. Lin. 2000. A hybrid heuristic to solve a task allocation problem. Eur. Journal. Operations research. 27 287-303.

Dutta, A., G. Koehler, A. Whinston. 1982. On optimal allocation in a distributed processing environment. Management Sci. 28 839-853.

Ernst, A. T., H. Jiang, M. Krishnamoorthy, B. Owens, D. Sier. 2004. An annotated bibliography of personnel scheduling and rostering. Annals of Operations Research 127 21-144.

Ernst, A. T., H. Jiang, M. Krishnamoorthy. 2006. Exact solutions to task allocation problems. Management Sci. 52 1634-1646.

Hamam, Y., K. S. Hindi 2000. Assignment of program modules to processors: A simulated annealing approach. Eur. J. Oper. Res. 122 509-513.

Kolen, A.W.J, J.K. Lenstra, C.H. Papadimitriou, F.C.R. Spieksma. 2007. Interval scheduling: a survey. Naval research logistics. 54(5) 530-543.

Kopidakis, Y., M. Laman, V. Zissimopoulos. 1997. On the task assignment problem: two new efficient heuristic algorithms. Journal parallel Distributed Comput. 42 21-29.

Lo, V. M. 1988. Heuristic algorithms for task assignment in distributed systems. IEEE Trans. Comput. 37 1384-1397.

Ma, P. Y. R., E. Y. S. Lee, M. T. Tsuchiya. 1982. A task allocation model for distributed computing systems. IEEE Trans. Comput. C-31 41-47.

Milis, I. 1995. Task assignment in distributed systems using network flow methods. Computer Sci, Vol. 1120. Springer-Verlag, London, UK, 396-405.

Sadykov, R., L. A. Wosley. 2006. Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates. INFORMS Journal on computing 18 209-217.

Sarje, A. K., G. Sagar. 1991. Heuristic model for task allocation in distributed computer systems. IEE Proc. E-138 313-318.

Steenken, D., S. VoB, R. Stahlback. 2004. Container terminal operation and operations research. OR Spectrum 26 3-49.

Downloads

Additional Files

Published

2023-01-20

Issue

Vol. 20 No. 2 (2023): January

Section

Artikel

License

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.

Creative Commons License
Transformatika is licensed under a  Creative Commons Attribution 4.0 International License.