IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v7y2003i1d10.1023_a1021942422161.html
   My bibliography  Save this article

Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups

Author

Listed:
  • Adar A. Kalir

    (Virginia Polytechnic Institute and State University)

  • Subhash C. Sarin

    (Virginia Polytechnic Institute and State University)

Abstract

Lot streaming—the process of splitting a production lot into sublots—has been a common practice in flow-shop systems during the past decade. Nevertheless, a major limiting assumption has been made in the analysis of these systems in that the setup time is, at most, lot-attached but not sublot-attached. In this paper, we consider the single and multiple batch flow-shop lot-streaming problems with sublot-attached setup times. A fast, optimal solution algorithm for the single batch problem is presented. For the multiple batch problem, we propose a near optimal solution procedure which is optimal in two-machine flow-shops. Computational results are also presented for the multiple batch problem which indicate both the efficiency and effectiveness of this procedure.

Suggested Citation

  • Adar A. Kalir & Subhash C. Sarin, 2003. "Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups," Journal of Combinatorial Optimization, Springer, vol. 7(1), pages 23-44, March.
    • Handle: RePEc:spr:jcomop:v:7:y:2003:i:1:d:10.1023_a:1021942422161
    DOI: 10.1023/A:1021942422161
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1021942422161
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1021942422161?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Stéphane Dauzère-Pérès & Jean-Bernard Lasserre, 1997. "Lot Streaming in Job-Shop Scheduling," Operations Research, INFORMS, vol. 45(4), pages 584-595, August.
    2. Kalir, Adar A. & Sarin, Subhash C., 2001. "A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots," Omega, Elsevier, vol. 29(6), pages 577-584, December.
    3. Vickson, R. G., 1995. "Optimal lot streaming for multiple products in a two-machine flow shop," European Journal of Operational Research, Elsevier, vol. 85(3), pages 556-575, September.
    4. Dan Trietsch & Kenneth R. Baker, 1993. "Basic Techniques for Lot Streaming," Operations Research, INFORMS, vol. 41(6), pages 1065-1076, December.
    5. Baker, KR & Jia, D, 1993. "A comparative study of lot streaming procedures," Omega, Elsevier, vol. 21(5), pages 561-566, September.
    6. Kalir, Adar A. & Sarin, Subhash C., 2000. "Evaluation of the potential benefits of lot streaming in flow-shop systems," International Journal of Production Economics, Elsevier, vol. 66(2), pages 131-142, June.
    7. Chen, Jiang & Steiner, George, 1997. "Lot streaming with detached setups in three-machine flow shops," European Journal of Operational Research, Elsevier, vol. 96(3), pages 591-611, February.
    8. Glass, C. A. & Gupta, J. N. D. & Potts, C. N., 1994. "Lot streaming in three-stage production processes," European Journal of Operational Research, Elsevier, vol. 75(2), pages 378-394, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    2. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    3. Sarin, Subhash C. & Kalir, Adar A. & Chen, Ming, 2008. "A single-lot, unified cost-based flow shop lot-streaming problem," International Journal of Production Economics, Elsevier, vol. 113(1), pages 413-424, May.
    4. Arianna Alfieri & Shuyu Zhou & Rosario Scatamacchia & Steef L. van de Velde, 2021. "Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop," 4OR, Springer, vol. 19(2), pages 265-288, June.

    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. D Biskup & M Feldmann, 2006. "Lot streaming with variable sublots: an integer programming formulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 296-303, March.
    2. Zhang, Wei & Yin, Changyu & Liu, Jiyin & Linn, Richard J., 2005. "Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops," International Journal of Production Economics, Elsevier, vol. 96(2), pages 189-200, May.
    3. Vickson, Raymond G. & Hassini, Elkafi, 2006. "Lot streaming for quality control in two-stage batch production," European Journal of Operational Research, Elsevier, vol. 170(3), pages 824-843, May.
    4. Chiu, Huan Neng & Chang, Jen Huei, 2005. "Cost models for lot streaming in a multistage flow shop," Omega, Elsevier, vol. 33(5), pages 435-450, October.
    5. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    6. Chung‐Lun Li & Wen‐Qiang Xiao, 2004. "Lot streaming with supplier–manufacturer coordination," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(4), pages 522-542, June.
    7. Kalir, Adar A. & Sarin, Subhash C., 2001. "A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots," Omega, Elsevier, vol. 29(6), pages 577-584, December.
    8. Chen, Jiang & Steiner, George, 1997. "Lot streaming with detached setups in three-machine flow shops," European Journal of Operational Research, Elsevier, vol. 96(3), pages 591-611, February.
    9. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    10. Liu, Jiyin, 2008. "Single-job lot streaming in m - 1 two-stage hybrid flowshops," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1171-1183, June.
    11. Kalir, Adar A. & Sarin, Subhash C., 2000. "Evaluation of the potential benefits of lot streaming in flow-shop systems," International Journal of Production Economics, Elsevier, vol. 66(2), pages 131-142, June.
    12. Arianna Alfieri & Shuyu Zhou & Rosario Scatamacchia & Steef L. van de Velde, 2021. "Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop," 4OR, Springer, vol. 19(2), pages 265-288, June.
    13. Tseng, Chao-Tang & Liao, Ching-Jong, 2008. "A discrete particle swarm optimization for lot-streaming flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 360-373, December.
    14. Yossi Bukchin & Michael Masin & Rinat Kirshner, 2010. "Modeling and analysis of multiobjective lot splitting for N‐product M‐machine flowshop lines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(4), pages 354-366, June.
    15. Sarin, Subhash C. & Kalir, Adar A. & Chen, Ming, 2008. "A single-lot, unified cost-based flow shop lot-streaming problem," International Journal of Production Economics, Elsevier, vol. 113(1), pages 413-424, May.
    16. Tzu-Li Chen & Chen-Yang Cheng & Yi-Han Chou, 2020. "Multi-objective genetic algorithm for energy-efficient hybrid flow shop scheduling with lot streaming," Annals of Operations Research, Springer, vol. 290(1), pages 813-836, July.
    17. Sen, Alper & Topaloglu, Engin & Benli, Omer S., 1998. "Optimal streaming of a single job in a two-stage flow shop," European Journal of Operational Research, Elsevier, vol. 110(1), pages 42-62, October.
    18. Shi Qiang Liu & Erhan Kozan & Mahmoud Masoud & Debiao Li & Kai Luo, 2025. "Multi-stage mine production timetabling with optimising the sizes of mining operations: an application of parallel-machine flow shop scheduling with lot streaming," Annals of Operations Research, Springer, vol. 348(2), pages 1-27, May.
    19. Buscher, Udo & Shen, Liji, 2009. "An integrated tabu search algorithm for the lot streaming problem in job shops," European Journal of Operational Research, Elsevier, vol. 199(2), pages 385-399, December.
    20. Niloy J. Mukherjee & Subhash C. Sarin & Daniel A. Neira, 2023. "Lot streaming for a two-stage assembly system in the presence of handling costs," Journal of Scheduling, Springer, vol. 26(4), pages 335-351, August.

    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:spr:jcomop:v:7:y:2003:i:1:d:10.1023_a:1021942422161. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.