Recent Advances of Disсrete Optimization and Scheduling

• Format: eBook
• Language: English
• Published: MDPI - Multidisciplinary Digital Publishing Institute 2024
• Subjects: adaptability; ant colony optimization; approximate algorithms; approximation; approximation algorithms; autonomy; axial assignment problem; batching; bin packing problem; branch-and-bound; capacity increase; continuous optimization problem; decomposition; deterioration; digital twin; discrete optimization problem; enterprise; Goethals–Seidel sequences; grey wolf optimizer; health scheduling; integer programming; Java macaque algorithm; k-block and k-partition; mixed linear integer programming; multi-agent technology; multi-index problem; n/a; nature-inspired algorithm; NP-hardness; ontology; operational transconductance amplifiers; plane graph; pole/zero extraction; polynomial algorithm; rate-modifying activity; real time; resource management; root splitting; routing; scheduling; scheduling problem; scheduling theory; shared common setups; simplification; simulated annealing; single machine scheduling; symbolic circuit analysis; symmetry and antisymmetry; total completion time; total weighted completion times
• ISBN: 372580673X; 3725806748; 9783725806737; 9783725806744
• DOI: 10.3390/books978-3-7258-0674-4

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.