Cover Image

Exact and Heuristic Scheduling Algorithms

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...

Full description

Saved in:
Bibliographic Details
Main Author: Werner, Frank (auth)
Other Authors: Sotskov, Yuri (auth), Burtseva, Larysa (auth)
Format: Electronic Book Chapter
Language:English
Published: MDPI - Multidisciplinary Digital Publishing Institute 2020
Subjects:
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
Online Access:DOAB: download the publication
DOAB: description of the publication
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
Physical Description:1 electronic resource (200 p.)
ISBN:books978-3-03928-469-6
9783039284696
9783039284689
Access:Open Access

Similar Items