Explore
Exact and Heuristic Scheduling Algorithms
0 Ungluers have
Faved this Work
Login to Fave
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.
This book is included in DOAB.
Why read this book? Have your say.
You must be logged in to comment.
Rights Information
Are you the author or publisher of this work? If so, you can claim it as yours by registering as an Unglue.it rights holder.Downloads
This work has been downloaded 1385 times via unglue.it ebook links.
- 3 - pdf (CC BY-NC-ND) at Unglue.it.
Keywords
- auto-carrier transportation problem (ACTP)
- blocking
- complexity
- computational experiment
- exact algorithms
- feasible loading
- flow shop
- flow shop problem
- flow shop problem, uniform parallel machine problems
- flow-shop
- flowshop
- heuristic
- heuristic algorithm
- heuristics
- job shop
- job shop problem
- job shop scheduling
- job-shop
- makespan
- makespan criterion
- manufacturing
- optimal algorithm
- permutations
- precedence constraints
- project scheduling
- quadratic programming
- repairing scheme
- resource leveling
- resource leveling problem
- s-precedence constraints
- Scheduling
- shop floor performance
- simulated annealing
- time complexity
- time windows
- total tardiness
- traveling salesman problem
- unavailability constraints
- uncertain duration
- uncertainty
- uniform parallel machine problems
- uniform parallel machines
Links
DOI: 10.3390/books978-3-03928-469-6Editions
