Recent Advances of Disсrete Optimization and Scheduling
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 prob...
में बचाया:
| स्वरूप: | Online |
|---|---|
| भाषा: | अंग्रेज़ी |
| प्रकाशित: |
MDPI - Multidisciplinary Digital Publishing Institute
2024
|
| विषय: | |
| ऑनलाइन पहुंच: | ONIX_20240514_9783725806737_396 |
| टैग: |
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|
| _version_ | 1869525533961748480 |
|---|---|
| collection | Directory of Open Access Books |
| description | 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 | Online |
| id | doab-20.500.12854ir-137800 |
| institution | Directory of Open Access Books |
| language | eng |
| publishDate | 2024 |
| publishDateRange | 2024 |
| publishDateSort | 2024 |
| publisher | MDPI - Multidisciplinary Digital Publishing Institute |
| publisherStr | MDPI - Multidisciplinary Digital Publishing Institute |
| record_format | ojs |
| spelling | doab-20.500.12854ir-1378002024-05-14T14:30:14Z Recent Advances of Disсrete Optimization and Scheduling Lazarev, Alexander A Werner, Frank Lin, Bertrand M.T. 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 Goethals–Seidel sequences k-block and k-partition symmetry and antisymmetry scheduling theory single machine scheduling total weighted completion times approximation n/a 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. 2024-05-14T14:30:04Z 2024-05-14T14:30:04Z 2024 book ONIX_20240514_9783725806737_396 9783725806737 9783725806744 https://directory.doabooks.org/handle/20.500.12854/137800 eng application/octet-stream Attribution-NonCommercial-NoDerivatives 4.0 International https://mdpi.com/books/pdfview/book/9035 https://mdpi.com/books/pdfview/book/9035 MDPI - Multidisciplinary Digital Publishing Institute 10.3390/books978-3-7258-0674-4 10.3390/books978-3-7258-0674-4 46cabcaa-dd94-4bfe-87b4-55023c1b36d0 9783725806737 9783725806744 214 open access |
| spellingShingle | 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 Goethals–Seidel sequences k-block and k-partition symmetry and antisymmetry scheduling theory single machine scheduling total weighted completion times approximation n/a Recent Advances of Disсrete Optimization and Scheduling |
| title | Recent Advances of Disсrete Optimization and Scheduling |
| title_full | Recent Advances of Disсrete Optimization and Scheduling |
| title_fullStr | Recent Advances of Disсrete Optimization and Scheduling |
| title_full_unstemmed | Recent Advances of Disсrete Optimization and Scheduling |
| title_short | Recent Advances of Disсrete Optimization and Scheduling |
| title_sort | recent advances of disсrete optimization and scheduling |
| topic | 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 Goethals–Seidel sequences k-block and k-partition symmetry and antisymmetry scheduling theory single machine scheduling total weighted completion times approximation n/a |
| topic_facet | 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 Goethals–Seidel sequences k-block and k-partition symmetry and antisymmetry scheduling theory single machine scheduling total weighted completion times approximation n/a |
| url | ONIX_20240514_9783725806737_396 |