Theoretical and Computational Research in Various Scheduling Models
Wu, Chin-Chia
Theoretical and Computational Research in Various Scheduling Models - Basel MDPI - Multidisciplinary Digital Publishing Institute 2022 - 1 electronic resource (208 p.)
Open Access
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.
Creative Commons
English
books978-3-0365-3019-2 9783036530192 9783036530185
10.3390/books978-3-0365-3019-2 doi
Research & information: general
Mathematics & science
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
Theoretical and Computational Research in Various Scheduling Models - Basel MDPI - Multidisciplinary Digital Publishing Institute 2022 - 1 electronic resource (208 p.)
Open Access
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.
Creative Commons
English
books978-3-0365-3019-2 9783036530192 9783036530185
10.3390/books978-3-0365-3019-2 doi
Research & information: general
Mathematics & science
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