Flexible Assembly Job-Shop Scheduling With Sequence-Dependent Setup Times and Part Sharing in a Dynamic Environment: Constraint Programming Model, Mixed-Integer Programming Model, and Dispatching Rules

This paper studies the flexible assembly job-shop scheduling problem in a dynamic manufacturing environment, which is an exension of job-shop scheduling with incorporation of serveral types of flexibilies and integration of an assembly stage. Each product is assembled from several parts with nonline...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on engineering management Jg. 65; H. 3; S. 487 - 504
Hauptverfasser:	Zhang, Sicheng, Wang, Shouyang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.08.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Assembly Assembly job-shop scheduling Completion time Constraint modelling constraint programming (CP) Dispatching Dispatching rules Dynamic programming Dynamic scheduling Fitness flexible job-shop scheduling Genetic algorithms Integer programming Job shop scheduling Job shops Linear programming Machining mixed-integer linear programming (MILP) Production scheduling Rescheduling Scheduling Sequential scheduling Setup times
ISSN:	0018-9391, 1558-0040
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!