Scheduling with centralized and decentralized batching policies in concurrent open shops

Authors

  • B. M. T. Lin,

    Corresponding author
    1. Department of Information and Finance Management, Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan
    • Department of Information and Finance Management, Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan
    Search for more papers by this author
  • T. C. E. Cheng

    1. Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong
    Search for more papers by this author

Abstract

This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo-polynomial time algorithms for some problems that are NP-hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011

Ancillary