This paper considers a single-machine scheduling problem where the decision authorities and information are distributed in multiple subproduction systems. Subproduction systems share the single machine and must cooperate with one another to achieve a global goal of minimizing a linear function of the completion times of the jobs; e.g., total weighted completion times. It is assumed that neither the subproduction systems nor the shared machine have complete information about the entire system. The associated scheduling problems are formulated as zero-one integer programs. The solution approach is based on Lagrangian relaxation techniques modified to require less global information. Specifically, there is no need for a global upper bound, or a single master problem that has a complete view of all the coupling constraints. The proposed methodology exhibits a promising performance when experimentally compared to the Lagrangian relaxation with a subgradient method with the added benefit that can be applied to situations with more restrictive information sharing.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
Document Type: Research Article
Department of Industrial Engineering, Hanyang University, 133-791, Seoul, Korea
Department of Engineering Technology and Department of Industrial Engineering, TAMUS 3367, Texas A&M University, 77843-3367, College Station, TX, USA
Publication date: 2005-02-01