Aggregate Capacitated Lot-Size Scheduling for a Class of Flexible Machining and Assembly Systems

A class of flexible machining and assembly systems is considered. In this class, each end item is assembled from a number of components. Each component undergoes a sequence of operations on various machines. The assembly structure of all items is flat. At least for some operations on some machines,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IIE transactions Jg. 23; H. 3; S. 259 - 266
Hauptverfasser: TOCZYLOWSKI, EUGENTUSZ, HINDI, KHALIL S.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Norcross Taylor & Francis Group 01.09.1991
Taylor & Francis Ltd
Schlagworte:
ISSN:0740-817X, 2472-5854, 1545-8830, 2472-5862
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A class of flexible machining and assembly systems is considered. In this class, each end item is assembled from a number of components. Each component undergoes a sequence of operations on various machines. The assembly structure of all items is flat. At least for some operations on some machines, setups are not negligible. Aggregation of constraints and items is employed and the problem of aggregate capacitated lot-size scheduling is formulated. Three different approaches for efficiently solving the resulting mixed binary programming problem are presented and discussed. The first is based on Lagrangian relaxation, die second on a mixed-integer network flow reformulation, while the third is based on a sub-linearization scheme. Handled by the Department of Scheduling/planning/control
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0740-817X
2472-5854
1545-8830
2472-5862
DOI:10.1080/07408179108963860