An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals

Random job arrivals that happen frequently in manufacturing practice may create a need for dynamic scheduling. This paper considers an issue of how to reschedule the randomly arrived new jobs to pursue both performance and stability of a schedule in a job shop. Firstly, a mixed integer programming m...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Swarm and evolutionary computation Jg. 51; S. 100594
Hauptverfasser:	Wang, Zhen, Zhang, Jihui, Yang, Shengxiang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.12.2019
Schlagworte:	Dynamic job shop scheduling Match-up strategy Multi-objective problem New job arrival Particle swarm optimization New job arrival Dynamic job shop scheduling Particle swarm optimization Multi-objective problem Match-up strategy
ISSN:	2210-6502
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!