Solving the preference-based conference scheduling problem through domain transformation approach
Conference scheduling can be quite a simple and straightforward problem if the number of papers to be scheduled is small.However, the problem can be very challenging and complex if the number of papers is large and various additional constraints need to be satisfied.Conference scheduling with regard...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2017
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/22826/1/ICOCI%202017%20199-207.pdf |
| _version_ | 1825804821971599360 |
|---|---|
| author | Abdul Rahim, Siti Khatijah Nor Jaafar, Amir Hamzah Bargiela, Andrzej Zulkipli, Faridah |
| author_facet | Abdul Rahim, Siti Khatijah Nor Jaafar, Amir Hamzah Bargiela, Andrzej Zulkipli, Faridah |
| author_sort | Abdul Rahim, Siti Khatijah Nor |
| collection | UUM |
| description | Conference scheduling can be quite a simple and straightforward problem if the number of papers to be scheduled is small.However, the problem can be very challenging and complex if the number of papers is large and various additional constraints need to be satisfied.Conference scheduling with regard to satisfying participants’ preferences can be understood as to generate schedule to minimize the clashes between slots or sessions that participants are interested to attend.Motivated by the current research trend in maximizing participants’ satisfactions, the study looks at the possibility of scheduling papers to sessions without any conflict by considering preferences by participants.In this research, preferences refer to the papers chosen by participants that they would like to attend its’ presentations
sessions.Domain Transformation Approach (DTA), which has produced very encouraging results in our previous works, is used in this study to solve preference-based conference scheduling problem. The purpose of utilizing the method is to test the generality and universality of the approach
in producing feasible schedule, given a different scheduling problem.The results obtained confirm that DTA efficiently generated feasible schedule
which satisfies hard constraints and also fulfills all the preferences.With the generated schedule, all participants are able to attend their sessions of interest.In the future work, additional constraints will be taken into account in
optimizing the schedules, for example balancing the number of papers assigned to each timeslot, and minimizing assignment of presenters to different timeslots.Other datasets could also be tested in order to test the generality of the proposed approach. |
| first_indexed | 2024-07-04T06:21:59Z |
| format | Conference or Workshop Item |
| id | uum-22826 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T06:21:59Z |
| publishDate | 2017 |
| record_format | eprints |
| spelling | uum-228262017-07-26T08:26:13Z https://repo.uum.edu.my/id/eprint/22826/ Solving the preference-based conference scheduling problem through domain transformation approach Abdul Rahim, Siti Khatijah Nor Jaafar, Amir Hamzah Bargiela, Andrzej Zulkipli, Faridah QA75 Electronic computers. Computer science Conference scheduling can be quite a simple and straightforward problem if the number of papers to be scheduled is small.However, the problem can be very challenging and complex if the number of papers is large and various additional constraints need to be satisfied.Conference scheduling with regard to satisfying participants’ preferences can be understood as to generate schedule to minimize the clashes between slots or sessions that participants are interested to attend.Motivated by the current research trend in maximizing participants’ satisfactions, the study looks at the possibility of scheduling papers to sessions without any conflict by considering preferences by participants.In this research, preferences refer to the papers chosen by participants that they would like to attend its’ presentations sessions.Domain Transformation Approach (DTA), which has produced very encouraging results in our previous works, is used in this study to solve preference-based conference scheduling problem. The purpose of utilizing the method is to test the generality and universality of the approach in producing feasible schedule, given a different scheduling problem.The results obtained confirm that DTA efficiently generated feasible schedule which satisfies hard constraints and also fulfills all the preferences.With the generated schedule, all participants are able to attend their sessions of interest.In the future work, additional constraints will be taken into account in optimizing the schedules, for example balancing the number of papers assigned to each timeslot, and minimizing assignment of presenters to different timeslots.Other datasets could also be tested in order to test the generality of the proposed approach. 2017-04-25 Conference or Workshop Item PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/22826/1/ICOCI%202017%20199-207.pdf Abdul Rahim, Siti Khatijah Nor and Jaafar, Amir Hamzah and Bargiela, Andrzej and Zulkipli, Faridah (2017) Solving the preference-based conference scheduling problem through domain transformation approach. In: 6th International Conference on Computing & Informatics (ICOCI2017), 25 - 27 April 2017, Kuala Lumpur. http://icoci.cms.net.my/PROCEEDINGS/2017/Pdf_Version_Chap03e/PID168-199-207e.pdf |
| spellingShingle | QA75 Electronic computers. Computer science Abdul Rahim, Siti Khatijah Nor Jaafar, Amir Hamzah Bargiela, Andrzej Zulkipli, Faridah Solving the preference-based conference scheduling problem through domain transformation approach |
| title | Solving the preference-based conference scheduling problem through domain transformation approach |
| title_full | Solving the preference-based conference scheduling problem through domain transformation approach |
| title_fullStr | Solving the preference-based conference scheduling problem through domain transformation approach |
| title_full_unstemmed | Solving the preference-based conference scheduling problem through domain transformation approach |
| title_short | Solving the preference-based conference scheduling problem through domain transformation approach |
| title_sort | solving the preference based conference scheduling problem through domain transformation approach |
| topic | QA75 Electronic computers. Computer science |
| url | https://repo.uum.edu.my/id/eprint/22826/1/ICOCI%202017%20199-207.pdf |
| work_keys_str_mv | AT abdulrahimsitikhatijahnor solvingthepreferencebasedconferenceschedulingproblemthroughdomaintransformationapproach AT jaafaramirhamzah solvingthepreferencebasedconferenceschedulingproblemthroughdomaintransformationapproach AT bargielaandrzej solvingthepreferencebasedconferenceschedulingproblemthroughdomaintransformationapproach AT zulkiplifaridah solvingthepreferencebasedconferenceschedulingproblemthroughdomaintransformationapproach |