Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multipurpose machines are discussed. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for the different classes of deterministic scheduling problems are updated and summarized. Also the references are updated. TOC:Classification of Scheduling Problems.- Some Problems in Combinatorial Optimization.- Computational Complexity.- Single Machine Scheduling Problems.- Parallel Machines.- Shop Scheduling Problems.- Due-Date Scheduling.- Batching Problems.- Changeover Times and Transportation Times.- Multi-Purpose Machines.- Multiprocessor Tasks "Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multipurpose machines are discussed. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for the different classes of deterministic scheduling problems are updated and summarized. Also the references are updated."--BOOK JACKET Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multipurpose machines are discussed. The method used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for the different classes of deterministic scheduling problems are updated and summarized. Also the references are updated. (Midwest) Besides scheduling problems for single and parallel machines and shop scheduling problems, this book covers advanced models involving due-dates, sequence dependent changeover times and batching. Discussion also extends to multiprocessor task scheduling and problems with multi-purpose machines. Among the methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. The text goes on to summarize complexity results for different classes of deterministic scheduling problems. Front Matter....Pages i-xii Classification of Scheduling Problems....Pages 1-10 Some Problems in Combinatorial Optimization....Pages 11-36 Computational Complexity....Pages 37-60 Single Machine Scheduling Problems....Pages 61-106 Parallel Machines....Pages 107-154 Shop Scheduling Problems....Pages 155-241 Due-Date Scheduling....Pages 243-265 Batching Problems....Pages 267-280 Changeover Times and Transportation Times....Pages 281-291 Multi-Purpose Machines....Pages 293-316 Multiprocessor Tasks....Pages 317-345 Back Matter....Pages 347-371
Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multi-purpose machines are discussed. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for different classes of deterministic scheduling problems are summerized.
Presenting scheduling problems for single and parallel machines and shop scheduling problems, this book covers advanced models involving due-dates, sequence dependent changeover times and batching. It also discusses multiprocessor task scheduling and problems with multi-purpose machines
