Theoretical and Computational Research in Various Scheduling Models
Nine manuscripts were published in this Special Issue on “Theoretical and Computational Research in Various Scheduling Models, 2021” of the MDPI Mathematics journal, covering a wide range of topics connected to the theory and applications of various scheduling models and their extensions/generalizat...
Պահպանված է:
| Ձևաչափ: | Online |
|---|---|
| Լեզու: | անգլերեն |
| Հրապարակվել է: |
MDPI - Multidisciplinary Digital Publishing Institute
2022
|
| Խորագրեր: | |
| Առցանց հասանելիություն: | ONIX_20220224_9783036530192_122 |
| Ցուցիչներ: |
Չկան պիտակներ, Եղեք առաջինը, ով նշում է այս գրառումը!
|
| _version_ | 1869530414503165952 |
|---|---|
| collection | Directory of Open Access Books |
| description | Nine manuscripts were published in this Special Issue on “Theoretical and Computational Research in Various Scheduling Models, 2021” of the MDPI Mathematics journal, covering a wide range of topics connected to the theory and applications of various scheduling models and their extensions/generalizations. These topics include a road network maintenance project, cost reduction of the subcontracted resources, a variant of the relocation problem, a network of activities with generally distributed durations through a Markov chain, idea on how to improve the return loading rate problem by integrating the sub-tour reversal approach with the method of the theory of constraints, an extended solution method for optimizing the bi-objective no-idle permutation flowshop scheduling problem, the burn-in (B/I) procedure, the Pareto-scheduling problem with two competing agents, and three preemptive Pareto-scheduling problems with two competing agents, among others. We hope that the book will be of interest to those working in the area of various scheduling problems and provide a bridge to facilitate the interaction between researchers and practitioners in scheduling questions. Although discrete mathematics is a common method to solve scheduling problems, the further development of this method is limited due to the lack of general principles, which poses a major challenge in this research field. |
| format | Online |
| id | doab-20.500.12854ir-78824 |
| institution | Directory of Open Access Books |
| language | eng |
| publishDate | 2022 |
| publishDateRange | 2022 |
| publishDateSort | 2022 |
| publisher | MDPI - Multidisciplinary Digital Publishing Institute |
| publisherStr | MDPI - Multidisciplinary Digital Publishing Institute |
| record_format | ojs |
| spelling | doab-20.500.12854ir-788242024-03-28T03:32:30Z Theoretical and Computational Research in Various Scheduling Models Wu, Chin-Chia Lin, Win-Chin two-agent Pareto-scheduling late work trade-off curve polynomial time scheduling two agents pareto frontier approximation algorithms unrelated parallel machine scheduling simulated annealing variable neighborhood descent metaheuristic production scheduling production management energy-efficiency no-idle flowshop metaheuristics TOC return loading rate logistics total transport distance northwest China stochastic makespan markov activity network phase-type distribution resource-constrained scheduling relocation problem flow shop resource recycling heuristic algorithms ant colony optimization scheduling theory operations research subcontracted resources scheduling on parallel machines renewable and non-renewable resources heuristic methods linear project linear scheduling method equipment idleness constraint programming equipment combination and configuration thema EDItEUR::G Reference, Information and Interdisciplinary subjects::GP Research and information: general thema EDItEUR::P Mathematics and Science Nine manuscripts were published in this Special Issue on “Theoretical and Computational Research in Various Scheduling Models, 2021” of the MDPI Mathematics journal, covering a wide range of topics connected to the theory and applications of various scheduling models and their extensions/generalizations. These topics include a road network maintenance project, cost reduction of the subcontracted resources, a variant of the relocation problem, a network of activities with generally distributed durations through a Markov chain, idea on how to improve the return loading rate problem by integrating the sub-tour reversal approach with the method of the theory of constraints, an extended solution method for optimizing the bi-objective no-idle permutation flowshop scheduling problem, the burn-in (B/I) procedure, the Pareto-scheduling problem with two competing agents, and three preemptive Pareto-scheduling problems with two competing agents, among others. We hope that the book will be of interest to those working in the area of various scheduling problems and provide a bridge to facilitate the interaction between researchers and practitioners in scheduling questions. Although discrete mathematics is a common method to solve scheduling problems, the further development of this method is limited due to the lack of general principles, which poses a major challenge in this research field. 2022-02-24T10:37:47Z 2022-02-24T10:37:47Z 2022 book ONIX_20220224_9783036530192_122 9783036530192 9783036530185 https://directory.doabooks.org/handle/20.500.12854/78824 eng image/jpeg Attribution 4.0 International https://mdpi.com/books/pdfview/book/4919 https://mdpi.com/books/pdfview/book/4919 MDPI - Multidisciplinary Digital Publishing Institute 10.3390/books978-3-0365-3019-2 10.3390/books978-3-0365-3019-2 46cabcaa-dd94-4bfe-87b4-55023c1b36d0 9783036530192 9783036530185 208 Basel open access |
| spellingShingle | two-agent Pareto-scheduling late work trade-off curve polynomial time scheduling two agents pareto frontier approximation algorithms unrelated parallel machine scheduling simulated annealing variable neighborhood descent metaheuristic production scheduling production management energy-efficiency no-idle flowshop metaheuristics TOC return loading rate logistics total transport distance northwest China stochastic makespan markov activity network phase-type distribution resource-constrained scheduling relocation problem flow shop resource recycling heuristic algorithms ant colony optimization scheduling theory operations research subcontracted resources scheduling on parallel machines renewable and non-renewable resources heuristic methods linear project linear scheduling method equipment idleness constraint programming equipment combination and configuration thema EDItEUR::G Reference, Information and Interdisciplinary subjects::GP Research and information: general thema EDItEUR::P Mathematics and Science Theoretical and Computational Research in Various Scheduling Models |
| title | Theoretical and Computational Research in Various Scheduling Models |
| title_full | Theoretical and Computational Research in Various Scheduling Models |
| title_fullStr | Theoretical and Computational Research in Various Scheduling Models |
| title_full_unstemmed | Theoretical and Computational Research in Various Scheduling Models |
| title_short | Theoretical and Computational Research in Various Scheduling Models |
| title_sort | theoretical and computational research in various scheduling models |
| topic | two-agent Pareto-scheduling late work trade-off curve polynomial time scheduling two agents pareto frontier approximation algorithms unrelated parallel machine scheduling simulated annealing variable neighborhood descent metaheuristic production scheduling production management energy-efficiency no-idle flowshop metaheuristics TOC return loading rate logistics total transport distance northwest China stochastic makespan markov activity network phase-type distribution resource-constrained scheduling relocation problem flow shop resource recycling heuristic algorithms ant colony optimization scheduling theory operations research subcontracted resources scheduling on parallel machines renewable and non-renewable resources heuristic methods linear project linear scheduling method equipment idleness constraint programming equipment combination and configuration thema EDItEUR::G Reference, Information and Interdisciplinary subjects::GP Research and information: general thema EDItEUR::P Mathematics and Science |
| topic_facet | two-agent Pareto-scheduling late work trade-off curve polynomial time scheduling two agents pareto frontier approximation algorithms unrelated parallel machine scheduling simulated annealing variable neighborhood descent metaheuristic production scheduling production management energy-efficiency no-idle flowshop metaheuristics TOC return loading rate logistics total transport distance northwest China stochastic makespan markov activity network phase-type distribution resource-constrained scheduling relocation problem flow shop resource recycling heuristic algorithms ant colony optimization scheduling theory operations research subcontracted resources scheduling on parallel machines renewable and non-renewable resources heuristic methods linear project linear scheduling method equipment idleness constraint programming equipment combination and configuration thema EDItEUR::G Reference, Information and Interdisciplinary subjects::GP Research and information: general thema EDItEUR::P Mathematics and Science |
| url | ONIX_20220224_9783036530192_122 |