Special Issue "Recent Advances of Disсrete Optimization and Scheduling"
Deadline for manuscript submissions: 28 February 2023 | Viewed by 4153
Interests: scheduling theory; discrete optimization; NP hardness; combinatorics; train scheduling; polynomial algorithms
Interests: scheduling, in particular development of exact and approximate algorithms; stability investigations is discrete optimization; scheduling with interval processing times; complexity investigations for scheduling problems; train scheduling; graph theory; logistics; supply chains; packing; simulation and applications
Special Issues, Collections and Topics in MDPI journals
Special Issue in Mathematics: Discrete Optimization: Theory, Algorithms, and Applications
Special Issue in Mathematics: Graph-Theoretic Problems and Their New Applications
Special Issue in Algorithms: Exact and Heuristic Scheduling Algorithms
Special Issue in Mathematics: Advances and Novel Approaches in Discrete Optimization
Special Issue in Algorithms: 2020 Selected Papers from Algorithms Editorial Board Members
Special Issue in Algorithms: Using Blockchain Technology in the Industry 4.0 Era: Cases and Applications
Special Issue in Mathematics: Mathematical Methods for Operations Research Problems
Special Issue in Algorithms: 2021 Selected Papers from Algorithms Editorial Board Members
Special Issue in Algorithms: 1st Online Conference on Algorithms (IOCA2021)
Special Issue in Algorithms: Scheduling: Algorithms and Applications
Topical Collection in Algorithms: Feature Papers in Algorithms
Special Issue in Algorithms: 2022 Selected Papers from Algorithms Editorial Board Members
Special Issue in Algorithms: Optimization Techniques, Algorithms, Applications for Cloud and Edge/Fog Computing Environments
Special Issue in Mathematics: Optimization Algorithms: Theory and Applications
The development of software products that enable effective planning and optimization of production processes is necessary to improve the quality of the industrial sector. This Special Issue is devoted to modern approaches to solving discrete optimization problems and scheduling problems. Special attention is paid to problems with practical applications. First of all, this concerns the tasks that were updated as a result of the pandemic crisis of 2020–2021: the tasks of managing medical institutions, the tasks of cargo transportation, the tasks of production planning, and so on. NP-hard problems are the most difficult since they require significant computational resources to find a solution in general cases. Various models are studied, and their effectiveness is compared based on the study of special (pseudo-)polynomial solvable cases of problems, the measure of (pseudo-)polynomial unsolvability, the radius of stability, and the efficiency of algorithms.
Dr. Alexander A Lazarev
Prof. Dr. Frank Werner
Prof. Dr. Bertrand M.T. Lin
Manuscript Submission Information
Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1800 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.
- scheduling theory
- discrete optimization
- NP hardness
- train scheduling
- plane graph
- polynomial algorithm
- multi-agent technology
- resource management