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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automation science and engineering Vol. 10; no. 3; pp. 757 - 771
Main Authors:	Xu, Jingyang, Nagi, Rakesh
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.07.2013 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!