Explore
Theoretical and Computational Research in Various Scheduling Models
0 Ungluers have
Faved this Work
Login to Fave
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.
This book is included in DOAB.
Why read this book? Have your say.
You must be logged in to comment.
Rights Information
Are you the author or publisher of this work? If so, you can claim it as yours by registering as an Unglue.it rights holder.Downloads
This work has been downloaded 34 times via unglue.it ebook links.
- 34 - pdf (CC BY) at Unglue.it.
Keywords
- ant colony optimization
- Approximation Algorithms
- constraint programming
- energy-efficiency
- equipment combination and configuration
- equipment idleness
- flow shop
- heuristic algorithms
- heuristic methods
- late work
- linear project
- linear scheduling method
- Logistics
- markov activity network
- Mathematics & science
- metaheuristic
- metaheuristics
- no-idle flowshop
- northwest China
- Operations research
- pareto frontier
- Pareto-scheduling
- phase-type distribution
- polynomial time
- Production management
- Production scheduling
- Reference, information & interdisciplinary subjects
- relocation problem
- renewable and non-renewable resources
- Research & information: general
- resource recycling
- resource-constrained scheduling
- return loading rate
- Scheduling
- scheduling on parallel machines
- scheduling theory
- simulated annealing
- stochastic makespan
- subcontracted resources
- TOC
- total transport distance
- trade-off curve
- two agents
- two-agent
- unrelated parallel machine scheduling
- variable neighborhood descent
Links
DOI: 10.3390/books978-3-0365-3019-2Editions