Solving assembly scheduling problems with tree-structure precedence constraints: A Lagrangian relaxation approach

In this paper, we consider an assembly scheduling problem (ASP) with tree-structured precedence constraints. In our problem, there are a number of work centers. Each work center contains a number of machines of the same functionality. The job to be processed via this system is a job with tree-struct...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on automation science and engineering Jg. 10; H. 3; S. 757 - 771
Hauptverfasser: Xu, Jingyang, Nagi, Rakesh
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.07.2013
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Assembly scheduling
Bills of materials
Heuristic
Integer programming
Job shop scheduling
Lagrange multiplier
Lagrangian relaxation (LR)
Linear programming
makespan
Manufacturing
Mathematical problems
Optimization techniques
parallel machine scheduling
Parallel machines
Production scheduling
randomized algorithm
subgradient search
ISSN:1545-5955, 1558-3783
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we consider an assembly scheduling problem (ASP) with tree-structured precedence constraints. In our problem, there are a number of work centers. Each work center contains a number of machines of the same functionality. The job to be processed via this system is a job with tree-structure precedence constraints. Each operation in the job has a designated work center. We propose a mixed integer linear programming formulation and solve the problem with a Lagrangian relaxation (LR) approach. We solve the subproblems of the LR problem via a heuristic method and generate feasible solutions via a randomized list scheduling algorithm. Near-optimal results are obtained and the computational time is within a few seconds for problems with size up to 20 machines and 300 operations.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1545-5955
1558-3783
DOI:10.1109/TASE.2013.2259816