Heuristic Method for Decision-Making in Common Scheduling Problems
AbstractThe aim of the paper is to present a heuristic method for decision-making regarding an NP-hard scheduling problem with limitations related to tasks and the resources dependent on the current state of the process. The presented approach is based on the algebraic-logical meta-model (ALMM), which enables making collective decisions in successive process stages, not separately for individual objects or executors. Moreover, taking into account the limitations of the problem, it involves constructing only an acceptable solution and significantly reduces the amount of calculations. A general algorithm based on the presented method is composed of the following elements: preliminary analysis of the problem, techniques for the choice of decision at a given state, the pruning non-perspective trajectory, selection technique of the initial state for the trajectory final part, and the trajectory generation parameters modification. The paper includes applications of the presented approach to scheduling problems on unrelated parallel machines with a deadline and machine setup time dependent on the process state, where the relationship between tasks is defined by the graph. The article also presents the results of computational experiments. View Full-Text
Share & Cite This Article
Kucharska, E. Heuristic Method for Decision-Making in Common Scheduling Problems. Appl. Sci. 2017, 7, 1073.
Kucharska E. Heuristic Method for Decision-Making in Common Scheduling Problems. Applied Sciences. 2017; 7(10):1073.Chicago/Turabian Style
Kucharska, Edyta. 2017. "Heuristic Method for Decision-Making in Common Scheduling Problems." Appl. Sci. 7, no. 10: 1073.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.