Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants

This paper deals with a job scheduling problem for a flexible manufacturing machine. We consider the same manufacturing environment described in a companion study (Part I), but we use a different performance criterion: to minimize the total number of instants at which tools are switched. This perfor...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research Jg. 36; H. 5; S. 778 - 784
Hauptverfasser: Tang, Christopher S, Denardo, Eric V
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Baltimore, Md INFORMS 01.09.1988
Operations Research Society of America
Schlagworte:
Agile manufacturing
Heuristics
Lexicography
Machine tools
Machinery
Mathematical procedures
Optimal solutions
production/scheduling: material handling
programming: integer, algorithms, branch-and-bound
Scheduling
ISSN:0030-364X, 1526-5463
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper deals with a job scheduling problem for a flexible manufacturing machine. We consider the same manufacturing environment described in a companion study (Part I), but we use a different performance criterion: to minimize the total number of instants at which tools are switched. This performance criterion is appropriate when the switching time is roughly constant and independent of the number of tool switches. We show that this scheduling problem generalizes the classical bin packing problem, and we present a non-LP-based branch-and-bound procedure that terminates with an optimal solution. We extend this procedure to the case of K machines in sequence.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.36.5.778