Heuristic Method for Decision-Making in Common Scheduling Problems
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 enabl...
Main Author: | Edyta Kucharska |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2017-10-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/7/10/1073 |
Similar Items
-
Dynamic Vehicle Routing Problem—Predictive and Unexpected Customer Availability
by: Edyta Kucharska
Published: (2019-04-01) -
A Study on Heuristic Task Scheduling Optimizing Task Deadline Violations in Heterogeneous Computational Environments
by: Bo Wang, et al.
Published: (2020-01-01) -
Some heuristics for the hybrid flow shop scheduling problem with setup and assembly operations
by: Fariborz Jolai, et al.
Published: (2013-06-01) -
Single Machine Scheduling Based on EDD-SDST-ACO Heuristic Algorithm
by: Song Haicao, et al.
Published: (2017-09-01) -
A Heuristic Rule Based on Complex Network for Open Shop Scheduling Problem With Sequence-Dependent Setup Times and Delivery Times
by: Zilong Zhuang, et al.
Published: (2019-01-01)