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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IIE transactions Ročník 23; číslo 3; s. 259 - 266
Hlavní autoři: TOCZYLOWSKI, EUGENTUSZ, HINDI, KHALIL S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Norcross Taylor & Francis Group 01.09.1991
Taylor & Francis Ltd
Témata:
Aggregate
Flexible manufacturing systems
Integer programming
Mathematical models
Production capacity
Production scheduling
Studies
ISSN:0740-817X, 2472-5854, 1545-8830, 2472-5862
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0740-817X
2472-5854
1545-8830
2472-5862
DOI:10.1080/07408179108963860