Next Article in Journal
Influence of the Microwave Heating Time on the Self-Healing Properties of Asphalt Mixtures
Next Article in Special Issue
A Lookahead Behavior Model for Multi-Agent Hybrid Simulation
Previous Article in Journal
Downdraft Assessment of Glass Curtain Wall Buildings with a Radiant Floor Heating System
Previous Article in Special Issue
Dynamic Scheduling of a Semiconductor Production Line Based on a Composite Rule Set
Article Menu
Issue 10 (October) cover image

Export Article

Open AccessArticle
Appl. Sci. 2017, 7(10), 1073; https://doi.org/10.3390/app7101073

Heuristic Method for Decision-Making in Common Scheduling Problems

Department of Automatics and Biomedical Engineering, AGH University of Science and Technology, 30 Mickiewicza Av, 30-059 Krakow, Poland
Received: 31 August 2017 / Revised: 30 September 2017 / Accepted: 11 October 2017 / Published: 17 October 2017
(This article belongs to the Special Issue Modeling, Simulation, Operation and Control of Discrete Event Systems)
View Full-Text   |   Download PDF [1370 KB, uploaded 19 October 2017]   |  

Abstract

The 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
Keywords: optimization of discrete systems; heuristic method; multistage decision process; algebraic-logical meta-model (ALMM); modeling; simulation; co-operation; scheduling problem with deadline and setup optimization of discrete systems; heuristic method; multistage decision process; algebraic-logical meta-model (ALMM); modeling; simulation; co-operation; scheduling problem with deadline and setup
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Kucharska, E. Heuristic Method for Decision-Making in Common Scheduling Problems. Appl. Sci. 2017, 7, 1073.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Appl. Sci. EISSN 2076-3417 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top