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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on automation science and engineering Ročník 10; číslo 3; s. 757 - 771
Hlavní autoři:	Xu, Jingyang, Nagi, Rakesh
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.07.2013 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
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!

Buďte první, kdo okomentuje tento záznam!