Exact and Heuristic Scheduling Algorithms

• Egile nagusia: Werner, Frank (auth)
• Beste egile batzuk: Sotskov, Yuri (auth), Burtseva, Larysa (auth)
• Formatua: Baliabide elektronikoa Liburu kapitulua
• Hizkuntza: ingelesa
• Argitaratua: MDPI - Multidisciplinary Digital Publishing Institute 2020
• Gaiak: History of engineering & technology; 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
• Sarrera elektronikoa: DOAB: download the publication; DOAB: description of the publication

This edited book presents new results in the area of the development of exact and heuristic scheduling algorithms. It contains eight articles accepted for publication for a Special Issue in the journal Algorithms. The book presents new algorithms, e.g., for flow shop, job shop, and parallel machine...