Classification of Schedules
Based on the notion of a schedule introduced in Chapter 2, this chapter presents a classification of schedules for project scheduling problems. While classification of schedules has been undertaken for the job shop problem (JSP) (cf. Baker (1974)), no systematic efforts are reported for project scheduling problems. Hence, based on the (informal) definitions given by Baker (1974) for the JSP, more precise and formal definitions are derived for the SMPSP and thus for the JSP, too. It has to be stressed that the schedule classification for the SMPSP covers multi-mode project scheduling problems (like the MMPSP and the PSPDL) as well since a solution of the latter is made of a mode-assignment M and a schedule S (cf. Section 2.1.4). Thus, it is sufficient to classify S. Furthermore, note that for the SMPSP start and finish times are functionally dependent as follows: ST j =FT j -d j , 1 ≤ j ≤ J. Hence the definitions supplied can be easily adapted to start times.
KeywordsOptimal Schedule Project Schedule Finish Time Feasible Schedule Operation Sequence
Unable to display preview. Download preview PDF.