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...

Celý popis

Podrobná bibliografia

Vydané v:	Swarm and evolutionary computation Ročník 51; s. 100594
Hlavní autori:	Wang, Zhen, Zhang, Jihui, Yang, Shengxiang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.12.2019
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!