Combinatorial Optimization Problems in Planning and Decision Making : Theory and Applications
Overview
Part I Intractable combinatorial optimization problems. PSC-algorithms.- Optimal scheduling for two criteria for a single machine with arbitrary due dates.- Optimal tasks execution for two criteria with a common due date on parallel machines.- Optimal scheduling for the vector criterion for parallel machines with arbitrary due dates.- The total weighted tardiness of tasks minimization on a single machine.- The total earliness/tardiness minimization on a single machine with arbitrary due dates.- The total tardiness of tasks minimization on identical parallel machines with a common due date.- Minimization of the maximum earliness/tardiness of tasks on identical parallel machines with a common due date.- The total weighted completion time of tasks minimization with precedence relations on a single machine.- Part II: Hierarchical planning and decision making in network systems with limited resources.- The four-level model of planning and decision making.- Algorithmic support of the four-level model of planning and decision making.- Models and methods of decision making with non-formalized goals.- Project 1. Informational Decision Support System for the project management in software development.- Project 2. Universal hierarchical system of scheduling and operational planning for the small-scale type of productions.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783030075521
- ISBN-10: 3030075524
- Publisher: Springer
- Publish Date: December 2018
- Dimensions: 9.21 x 6.14 x 1.08 inches
- Shipping Weight: 1.63 pounds
- Page Count: 518
Related Categories
