Reprint

Algorithms for Scheduling Problems

Edited by
July 2018
208 pages
  • ISBN978-3-03897-119-1 (Paperback)
  • ISBN978-3-03897-120-7 (PDF)

This book is a reprint of the Special Issue Algorithms for Scheduling Problems that was published in

Computer Science & Mathematics
Format
  • Paperback
License
© 2019 by the authors; CC BY license
Keywords
energy-conscious single machine scheduling; time-of-use electricity tariffs; greedy insertion heuristic; coarse granularity and fine granularity filtering mechanism; concentration and diffusion strategy; industrial supply chain; supply chain complexity; information entropy; just-in-time scheduling; flow shop; heuristics; RCPSP; combinatorial optimization; scheduling; linear programming; MES; Job Shop; facility network design; newsvendor model; bounded rationality; non-linear programming; decomposition method; linearization technique; railway traffic; disturbance management; real-time re-scheduling; job-shop scheduling; optimization; alternative graph; scheduling; optimal control; manufacturing; algorithm; attainable sets; scheduling; uncertain durations; single machine; total completion time; multiobjective genetic algorithm; hybrid flow shop; setup time; energy optimization; production environment; DSP microprocessor; multicore; multiprocessors; scheduling; workflow; resource management; job allocation; scheduling single machine; release time; lateness; makespan; bi-criteria scheduling; Pareto-optimal solution; scheduling; single-stage systems; multi-stage systems; single-criteria objective; multi-criteria objective; production planning