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 rega...
Saved in:
Main Authors: | Abdul Rahim, Siti Khatijah Nor, Jaafar, Amir Hamzah, Bargiela, Andrzej, Zulkipli, Faridah |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
School of Computing, UUM College of Arts and Sciences
2017
|
Online Access: | http://psasir.upm.edu.my/id/eprint/64456/1/PID168-199-207e.pdf http://psasir.upm.edu.my/id/eprint/64456/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solving the preference-based conference scheduling problem through domain transformation approach
by: Abdul Rahim, Siti Khatijah Nor, et al.
Published: (2017) -
Optimization capacity planning problem on conference scheduling
by: Zulkipli, Faridah, et al.
Published: (2013) -
Ontology and problem-solving method for scheduling in manufacturing
by: Mustapha, Muhamad Firdaus, et al.
Published: (2007) -
An improved genetic algorithm for solving the multiprocessor scheduling problem
by: Alshaikhli, Imad Fakhri Taha, et al.
Published: (2011) -
Using micro genetic algorithm for solving scheduling problems
by: Tay, Cheng San
Published: (2005)