2013 IEEE Business Engineering and Industrial Applications Colloquium (BEIAC) 2013
DOI: 10.1109/beiac.2013.6560270
|View full text |Cite
|
Sign up to set email alerts
|

Optimization capacity planning problem on conference scheduling

Abstract: Designing a conference scheduling involves various factors that need to be considered in order to fulfill the participants' preferences. Capacity planning problem is a main focus in this study in order to assign the papers that are to be presented into time slots based on paper of interest. All the presentation papers are assigned efficiently to avoid too many participants in a particular session. Goal Programming model has been developed to produce a schedule that maximizes the participants' satisfaction in t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 7 publications
0
4
0
Order By: Relevance
“…Both methods are tested on data from a conference of the Institute of Systems, Control and Information Engineers in Japan with 313 papers and 86 keywords. Zulkipli et al (2013) ignore session coherence as they attempt to group talks into equally popular sessions. The underlying idea is that in a setting with rooms of similar size and assuming that session hopping is forbidden, this will maximize participants' satisfaction in terms of seating capacity.…”
Section: Related Problemsmentioning
confidence: 99%
“…Both methods are tested on data from a conference of the Institute of Systems, Control and Information Engineers in Japan with 313 papers and 86 keywords. Zulkipli et al (2013) ignore session coherence as they attempt to group talks into equally popular sessions. The underlying idea is that in a setting with rooms of similar size and assuming that session hopping is forbidden, this will maximize participants' satisfaction in terms of seating capacity.…”
Section: Related Problemsmentioning
confidence: 99%
“…Such examples of past studies are by Tung and Pinnoi (2000) who described a study on waste collection vehicle routing-scheduling problem in Hanoi; Kim et al (2006) who conducted a study on waste collection VRPTW with multiple disposal trips and drivers lunch period; Ombuki-Berman et al Table 1 and Table 2 show that heuristic is the most preferred method in solving TDVRP and waste collection problem. This method also has been widely used in solving other real-life problems such as timetabling (Sultan et al, 2004;Abdul-Rahman et al, 2014), text clustering (Mohammed, Yusof & Husni, 2016) and scheduling (Zulkipli, Ibrahim & Benjamin, 2013;Benjamin, Abdul-Rahman & Engku Abu Bakar, 2013).…”
Section: Waste Collection Vehicle Routing Problemmentioning
confidence: 99%
“…He ensured the settlement of the papers by addressing the conference capacity with the method they call the Goal Programming model. With the proposed model, a solution was produced by taking the restriction capacity as the main factor [6]. Eglese and Rand proposed a heuristic method for conference scheduling, including simulated annealing.…”
Section: Introductionmentioning
confidence: 99%