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

Full description

Bibliographic Details

Published in:	Swarm and evolutionary computation Vol. 51; p. 100594
Main Authors:	Wang, Zhen, Zhang, Jihui, Yang, Shengxiang
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.12.2019
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!