Genetic algorithms with greedy strategy for green batch scheduling on non-identical parallel machines

Large scale batch scheduling problems with complex constraints are difficult and time-consuming to solve. Therefore, this paper addresses the green batch scheduling problem on non-identical parallel machines with time-of-use electricity prices. The objective of the problem is to minimise total elect...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Memetic computing 2019-12, Vol.11 (4), p.439-452
Hauptverfasser:	Tan, Mao, Yang, Hua-Li, Su, Yong-Xin
Format:	Artikel
Sprache:	eng
Schlagworte:	Applications of Mathematics Artificial Intelligence Batch processing Bioinformatics Complex Systems Computational efficiency Computing time Control Energy costs Engineering Genetic algorithms Greedy algorithms Mathematical and Computational Engineering Mechatronics Production scheduling Regular Research Paper Robotics Scheduling Strategy Time of use electricity pricing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!