TY  - BOOK
AU  - Werner, Frank||Sotskov, Yuri||Burtseva, Larysa
TI  - Exact and Heuristic Scheduling Algorithms
KW  - repairing scheme||makespan||complexity||uniform parallel machine problems||flow shop||uniform parallel machines||total tardiness||permutations||uncertainty||shop floor performance||heuristic algorithm||s-precedence constraints||heuristics||time windows||auto-carrier transportation problem (ACTP)||blocking||computational experiment||scheduling||manufacturing||optimal algorithm||precedence constraints||flowshop||flow-shop||flow shop problem||simulated annealing||traveling salesman problem||resource leveling||makespan criterion||project scheduling||uncertain duration||time complexity||heuristic||quadratic programming||feasible loading||exact algorithms||resource leveling problem||job shop problem||unavailability constraints||job shop||job-shop||job shop scheduling
UR  - https://mdpi.com/books/pdfview/book/2107
ER  -