Reprint

Exact and Heuristic Scheduling Algorithms

Edited by
March 2020
200 pages
  • ISBN978-3-03928-468-9 (Paperback)
  • ISBN978-3-03928-469-6 (PDF)

This is a Reprint of the Special Issue Exact and Heuristic Scheduling Algorithms that was published in

Computer Science & Mathematics
Summary
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 scheduling problems. The particular articles address subjects such as a heuristic for the routing and scheduling problem with time windows, applied to the automotive industry in Mexico, a heuristic for the blocking job shop problem with tardiness minimization based on new neighborhood structures, fast heuristics for the Euclidean traveling salesman problem or a new mathematical model for the period-aggregated resource leveling problem with variable job duration, and several others.

Related Books

The recommendations have been generated using an AI system.