Classification of Schedules

  • Rainer Kolisch
Part of the Production and Logistics book series (3197)


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 ≤ jJ. Hence the definitions supplied can be easily adapted to start times.


Optimal Schedule Project Schedule Finish Time Feasible Schedule Operation Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Rainer Kolisch
    • 1
  1. 1.Institut für BetriebswirtschaftslehreUniversität KielKielGermany

Personalised recommendations