Combinatorial Optimization Problems in Planning and Decision Making

Combinatorial Optimization Problems in Planning and Decision Making

Theory and Applications

Pavlov, Alexander A.; Zgurovsky, Michael Z.

Springer International Publishing AG

10/2018

518

Dura

Inglês

9783319989761

15 a 20 dias

957


ebook

Descrição não disponível.
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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
combinatorial optimization;scheduling theory;decision theory;computer-aided production management systems;hierarchical planning;planning model;operational planning;PSC-algorithm;regression analysis