IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v58y2011i1p17-27.html
   My bibliography  Save this article

Scheduling with centralized and decentralized batching policies in concurrent open shops

Author

Listed:
  • B. M. T. Lin
  • T. C. E. Cheng

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

Suggested Citation

  • B. M. T. Lin & T. C. E. Cheng, 2011. "Scheduling with centralized and decentralized batching policies in concurrent open shops," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(1), pages 17-27, February.
    • Handle: RePEc:wly:navres:v:58:y:2011:i:1:p:17-27
    DOI: 10.1002/nav.20437
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20437
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20437?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Leung, Joseph Y.-T. & Li, Haibing & Pinedo, Michael, 2006. "Scheduling orders for multiple product types with due date related objectives," European Journal of Operational Research, Elsevier, vol. 168(2), pages 370-389, January.
    2. Kovalyov, M. Y. & Potts, C. N. & Strusevich, V. A., 2004. "Batching decisions for assembly production systems," European Journal of Operational Research, Elsevier, vol. 157(3), pages 620-642, September.
    3. Cheng, T. C. Edwin & Gordon, Valery S. & Kovalyov, Mikhail Y., 1996. "Single machine scheduling with batch deliveries," European Journal of Operational Research, Elsevier, vol. 94(2), pages 277-283, October.
    4. Leung, Joseph Y-T. & Li, Haibing & Pinedo, Michael & Sriskandarajah, Chelliah, 2005. "Open shops with jobs overlap--revisited," European Journal of Operational Research, Elsevier, vol. 163(2), pages 569-571, June.
    5. Y.M. Shafransky & V.A. Strusevich, 1998. "The open shop scheduling problem with a given sequence of jobs on one machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(7), pages 705-731, October.
    6. Lin, B.M.T. & Kononov, A.V., 2007. "Customer order scheduling to minimize the number of late jobs," European Journal of Operational Research, Elsevier, vol. 183(2), pages 944-948, December.
    7. Wagneur, E. & Sriskandarajah, C., 1993. "Openshops with jobs overlap," European Journal of Operational Research, Elsevier, vol. 71(3), pages 366-378, December.
    8. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    9. van Hoesel, Stan & Wagelmans, Albert & Moerman, Bram, 1994. "Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions," European Journal of Operational Research, Elsevier, vol. 75(2), pages 312-331, June.
    10. Scott Webster & Kenneth R. Baker, 1995. "Scheduling Groups of Jobs on a Single Machine," Operations Research, INFORMS, vol. 43(4), pages 692-703, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liji Shen & Jatinder N. D. Gupta, 2018. "Family scheduling with batch availability in flow shops to minimize makespan," Journal of Scheduling, Springer, vol. 21(2), pages 235-249, April.
    2. Framinan, Jose M. & Perez-Gonzalez, Paz & Fernandez-Viagas, Victor, 2019. "Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures," European Journal of Operational Research, Elsevier, vol. 273(2), pages 401-417.
    3. Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
    4. Selvarajah, Esaignani & Steiner, George, 2006. "Batch scheduling in a two-level supply chain--a focus on the supplier," European Journal of Operational Research, Elsevier, vol. 173(1), pages 226-240, August.
    5. Chang, Yung-Chia & Lee, Chung-Yee, 2004. "Machine scheduling with job delivery coordination," European Journal of Operational Research, Elsevier, vol. 158(2), pages 470-487, October.
    6. F. Hwang & M. Kovalyov & B. Lin, 2014. "Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence," Annals of Operations Research, Springer, vol. 217(1), pages 263-279, June.
    7. Lung-Yu Li & Jian-You Xu & Shuenn-Ren Cheng & Xingong Zhang & Win-Chin Lin & Jia-Cheng Lin & Zong-Lin Wu & Chin-Chia Wu, 2022. "A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment," Mathematics, MDPI, vol. 10(21), pages 1-22, November.
    8. Jae-Min Yu & Rong Huang & Dong-Ho Lee, 2017. "Iterative algorithms for batching and scheduling to minimise the total job tardiness in two-stage hybrid flow shops," International Journal of Production Research, Taylor & Francis Journals, vol. 55(11), pages 3266-3282, June.
    9. Lin, B.M.T. & Cheng, T.C.E. & Chou, A.S.C., 2007. "Scheduling in an assembly-type production chain with batch transfer," Omega, Elsevier, vol. 35(2), pages 143-151, April.
    10. Xiangtong Qi, 2005. "A logistics scheduling model: Inventory cost reduction by batching," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 312-320, June.
    11. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    12. Esaignani Selvarajah & George Steiner, 2009. "Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs," Operations Research, INFORMS, vol. 57(2), pages 426-438, April.
    13. Mazdeh, Mohammad Mahdavi & Sarhadi, Mansoor & Hindi, Khalil S., 2007. "A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs," European Journal of Operational Research, Elsevier, vol. 183(1), pages 74-86, November.
    14. Nicholas G. Hall & Chris N. Potts, 2003. "Supply chain scheduling: Batching and delivery," Operations Research, INFORMS, vol. 51(4), pages 566-584, August.
    15. Jason Pan & Chi-Shiang Su, 2015. "Two parallel machines problem with job delivery coordination and availability constraint," Annals of Operations Research, Springer, vol. 235(1), pages 653-664, December.
    16. Cheng, T. C. Edwin & Janiak, Adam & Kovalyov, Mikhail Y., 2001. "Single machine batch scheduling with resource dependent setup and processing times," European Journal of Operational Research, Elsevier, vol. 135(1), pages 177-183, November.
    17. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    18. Wang, Guoqing & Cheng, T. C. Edwin, 2000. "Parallel machine scheduling with batch delivery costs," International Journal of Production Economics, Elsevier, vol. 68(2), pages 177-183, November.
    19. Artur Alves Pessoa & Teobaldo Bulhões & Vitor Nesello & Anand Subramanian, 2022. "Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1512-1530, May.
    20. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:58:y:2011:i:1:p:17-27. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.