INCORPORATING CAPACITATIVE CONSTRAINT TO THE PREFERENCE-BASED CONFERENCE SCHEDULING VIA DOMAIN TRANSFORMATION APPROACH

Organizing academic conference often creates conflicts among presenters in the form of unsatisfactory assignments of papers to time slots or sessions during the conference. This paper proposes an enhanced technique of scheduling the conference papers to time slots or sessions by applying Domain Transformation Approach (DTA). The objective of this work is to generate a conference schedule that satisfies hard constraint which ensures all papers associated with presenters and participants are scheduled without conflicts, besides balancing the numbers of papers in the overall slots. According to the results, the schedules generated are of high quality which managed to satisfy the constraints imposed. Based on our findings, DTA produced competitive schedules efficiently as expected which satisfied all of the participants’ preferences and balancing the allocation of papers to time slots.

[1]  Taiwo O. Ojeyinka.  Bin Packing Algorithms with Applications to Passenger Bus Loading and Multiprocessor Scheduling Problems , 2015 .

[2]  Andrzej Bargiela,et al.  Domain Transformation using Greedy Algorithm in Nurse Scheduling , 2015 .

[3]  Andrzej Bargiela,et al.  Granular Modelling Of Exam To Slot Allocation , 2009, ECMS.

[4]  Elliott N. Weiss,et al.  Designing Conferences to Improve Resource Utilization and Participant Satisfaction , 1996 .

[5]  Daniel Stey.  Scheduling a conference to minimize RSVP conicts , 2015 .

[6]  Joseph Y.-T. Leung,et al.  Bin packing: Maximizing the number of pieces packed , 2004, Acta Informatica.

[7]  Emrah B. Edis,et al.  AN INTEGER PROGRAMMING MODEL FOR THE CONFERENCE TIMETABLING PROBLEM , 2013 .

[8]  Andrzej Bargiela,et al.  The incorporation of late acceptance hill climbing strategy in the deterministic optimization of examination scheduling framework: A comparison with the traditional hill climbing , 2014, 2014 IEEE Conference on Systems, Process and Control (ICSPC 2014).

[9]  Andrzej Bargiela,et al.  Domain transformation approach to deterministic optimization of examination timetables , 2013, Artif. Intell. Res..

[10]  Haslinda Ibrahim,et al.  Optimization capacity planning problem on conference scheduling , 2013, 2013 IEEE Business Engineering and Industrial Applications Colloquium (BEIAC).

[11]  Adnan Yazici,et al.  A Novel Grouping Genetic Algorithm for the One-Dimensional Bin Packing Problem on GPU , 2016, ISCIS.

[12]  Andrzej Bargiela,et al.  A Study Of Cost Effective Scheduling Of Nurses Based On The Domain Transformation Method , 2013, ECMS.

[13]  Linda G. Carrington.  The Impact Of Course Scheduling On Student Success In Intermediate Accounting , 2010 .

[14]  Haslinda Ibrahim,et al.  Combinatorial design for a conference: constructing a balanced three-parallel session schedule , 2008 .

[15]  Scott E. Sampson.  Practical Implications of Preference-Based Conference Scheduling , 2009 .

[16]  Andrzej Bargiela,et al.  Simulation Of Scheduling And Cost Effectiveness Of Nurses Using Domain Transformation Method , 2014, ECMS.

[17]  Michael Eley,et al.  Ant Algorithms for the Exam Timetabling Problem , 2006, PATAT.

[18]  Rob van Stee,et al.  Online algorithms with advice for bin packing and scheduling problems , 2013, Theor. Comput. Sci..

[19]  Heather A Bellardo.  PREFERENCE DRIVEN UNIVERSITY COURSE SCHEDULING SYSTEM , 2010 .

[20]  E. Aycan,et al.  Solving the Course Scheduling Problem Using Simulated Annealing , 2009, 2009 IEEE International Advance Computing Conference.

[21]  Mehrdad Nouri Koupaei,et al.  A MATHEMATICAL MODEL FOR UNIVERSITY COURSE SCHEDULING: A CASE STUDY , 2015 .

[22]  Osama Al-Haj Hassan,et al.  A New Exam Scheduling Algorithm Using Graph Coloring , 2008, Int. Arab J. Inf. Technol..

[23]  Geetha Baskaran,et al.  A domain transformation approach for addressing staff scheduling problems , 2016 .

[24]  Andrzej Bargiela,et al.  Solving the preference-based conference scheduling problem through domain transformation approach , 2017 .