Machine Scheduling Problems : Classification, complexity and computations

1. Introduction -- 2. Problem Formulation -- 2.1. Notations and representations -- 2.2. Restrictive assumptions -- 2.3. Optimality criteria -- 2.4. Classification of problems -- 3. Methods of Solution -- 3.1. Complete enumeration -- 3.2. Combinatorial analysis -- 3.3. Mixed integer and non-linear programming -- 3.4. Branch-and-bound -- 3.5. Dynamic programming -- 3.6. Complexity theory -- 3.7. Heuristic methods -- 4. One-Machine Problems -- 4.1. n|1?cmax problems -- 4.2. n|1|i|Cmax problems -- 4.3. n|1??ci problems -- 4.4. n|1|?|?Ci problems -- 5. Two-Machine and Three-Machine Problems -- 5.1. The n|2|?,?|cmax and n|3|?,?|cmax problem -- 5.2. The n|2|F|?Ci problem -- 5.3. The n|2|P|Cmax problem with time lags -- 6. General Flow-Shop and Job-Shop Problems -- 6.1. The n|m|P|? problem -- 6.2. The n|m|F|? problem -- 6.3. The n|m|G|? problem -- 6.4. The n|m|?, no wait|? problem -- 7. Concluding Remarks -- 7.1. Complexity of scheduling problems -- 7.2. Practical scheduling problems -- 7.3. Conclusions -- List Of Notations -- References -- Author Index.