Reprint
Recent Advances of Disсrete Optimization and Scheduling
Edited by
March 2024
214 pages
- ISBN978-3-7258-0673-7 (Hardback)
- ISBN978-3-7258-0674-4 (PDF)
This book is a reprint of the Special Issue Recent Advances of Disсrete Optimization and Scheduling that was published in
Computer Science & Mathematics
Engineering
Physical Sciences
Public Health & Healthcare
Summary
This reprint of this Special Issue of Mathematics presents recent research within the field of discrete optimization and scheduling. The subjects addressed in the ten research papers cover a broad spectrum of optimization algorithms, e.g., papers dealing with nature-inspired algorithms, routing problems in plane graphs, the scheduling of surgeries in operation rooms, or single machine scheduling problems.
Format
- Hardback
License
© 2022 by the authors; CC BY-NC-ND license
Keywords
scheduling; batching; ant colony optimization; mixed linear integer programming; deterioration; rate-modifying activity; continuous optimization problem; discrete optimization problem; grey wolf optimizer; Java macaque algorithm; nature-inspired algorithm; health scheduling; approximation algorithms; decomposition; capacity increase; bin packing problem; scheduling problem; routing; plane graph; polynomial algorithm; axial assignment problem; multi-index problem; approximate algorithms; NP-hardness; autonomy; digital twin; enterprise; resource management; ontology; multi-agent technology; adaptability; real time; operational transconductance amplifiers; symbolic circuit analysis; pole/zero extraction; root splitting; simplification; simulated annealing; single-machine scheduling; shared common setups; total completion time; integer programming; branch-and-bound; ant colony optimization; Goethals–Seidel sequences; k-block and k-partition; symmetry and antisymmetry; scheduling theory; single machine scheduling; total weighted completion times; approximation; n/a