Unformatted text preview: classified as “conflicting pair” if some attendees want to visit both of them. Let C = {{ a i , b i }: i=1, …, m} be the set of m conflicting pairs classified by the attendees. Each seminar takes the same amount of time. Two seminars can be held in parallel in the same time slot if and only if they do not form a conflicting pair. Subject to this constraint it is required to arrange the seminars using as many parallel sessions as possible at any point of time, so as to keep the conference as short as possible. Design a network model for this problem. Questions 27: Chapter 1 (AMO) : 2, 4, 6, 7, 8, 10...
View
Full Document
 Spring '10
 zeynephuygur
 conflicting pair, following scheduling problem

Click to edit the document details