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. 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.
    2. ,, 1999. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 15(3), pages 427-432, June.
    3. 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.
    4. ,, 1999. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 15(4), pages 629-637, August.
    5. ,, 1999. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 15(5), pages 777-788, October.
    6. ,, 1999. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 15(1), pages 151-160, February.
    7. Dan Trietsch & Kenneth R. Baker, 1993. "Basic Techniques for Lot Streaming," Operations Research, INFORMS, vol. 41(6), pages 1065-1076, 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. 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.
    10. Baker, KR & Jia, D, 1993. "A comparative study of lot streaming procedures," Omega, Elsevier, vol. 21(5), pages 561-566, September.
    11. 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.
    12. 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. 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. 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.
    4. 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.
    5. Krzysztof S. Targiel & Maciej Nowak & Tadeusz Trzaskalik, 2018. "Scheduling non-critical activities using multicriteria approach," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(3), pages 585-598, September.
    6. F. Castro-Llanos & G. Hyman & J. Rubiano & J. Ramirez-Villegas & H. Achicanoy, 2019. "Climate change favors rice production at higher elevations in Colombia," Mitigation and Adaptation Strategies for Global Change, Springer, vol. 24(8), pages 1401-1430, December.
    7. Okitonyumbe Y.F., Joseph & Ulungu, Berthold E.-L., 2013. "Nouvelle caractérisation des solutions efficaces des problèmes d’optimisation combinatoire multi-objectif [New characterization of efficient solution in multi-objective combinatorial optimization]," MPRA Paper 66123, University Library of Munich, Germany.
    8. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    9. Monica Motta & Caterina Sartori, 2020. "Normality and Nondegeneracy of the Maximum Principle in Optimal Impulsive Control Under State Constraints," Journal of Optimization Theory and Applications, Springer, vol. 185(1), pages 44-71, April.
    10. Zhang, Quanzhong & Wei, Haiyan & Liu, Jing & Zhao, Zefang & Ran, Qiao & Gu, Wei, 2021. "A Bayesian network with fuzzy mathematics for species habitat suitability analysis: A case with limited Angelica sinensis (Oliv.) Diels data," Ecological Modelling, Elsevier, vol. 450(C).
    11. Chenchen Wu & Dachuan Xu & Donglei Du & Wenqing Xu, 2016. "An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1017-1035, November.
    12. Gengping Zhu & Matthew J Petersen & Wenjun Bu, 2012. "Selecting Biological Meaningful Environmental Dimensions of Low Discrepancy among Ranges to Predict Potential Distribution of Bean Plataspid Invasion," PLOS ONE, Public Library of Science, vol. 7(9), pages 1-9, September.
    13. Uzma Ashraf & Hassan Ali & Muhammad Nawaz Chaudry & Irfan Ashraf & Adila Batool & Zafeer Saqib, 2016. "Predicting the Potential Distribution of Olea ferruginea in Pakistan incorporating Climate Change by Using Maxent Model," Sustainability, MDPI, vol. 8(8), pages 1-11, July.
    14. Ernst Althaus & Felix Rauterberg & Sarah Ziegler, 2020. "Computing Euclidean Steiner trees over segments," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 309-325, October.
    15. World Bank, 2003. "Argentina : Reforming Policies and Institutions for Efficiency and Equity of Public Expenditures," World Bank Publications - Reports 14637, The World Bank Group.
    16. Ceretani, Andrea N. & Salva, Natalia N. & Tarzia, Domingo A., 2018. "Approximation of the modified error function," Applied Mathematics and Computation, Elsevier, vol. 337(C), pages 607-617.
    17. Parihar, Amit Kumar Singh & Hammer, Thomas & Sridhar, G., 2015. "Development and testing of tube type wet ESP for the removal of particulate matter and tar from producer gas," Renewable Energy, Elsevier, vol. 74(C), pages 875-883.
    18. Liang, Wanwan & Papeş, Monica & Tran, Liem & Grant, Jerome & Washington-Allen, Robert & Stewart, Scott & Wiggins, Gregory, 2018. "The effect of pseudo-absence selection method on transferability of species distribution models in the context of non-adaptive niche shift," Ecological Modelling, Elsevier, vol. 388(C), pages 1-9.
    19. Brown, Jeffrey R., 2001. "Private pensions, mortality risk, and the decision to annuitize," Journal of Public Economics, Elsevier, vol. 82(1), pages 29-62, October.
    20. Mark Christensen, 2007. "What We Might Know (But Aren't Sure) About Public-Sector Accrual Accounting," Australian Accounting Review, CPA Australia, vol. 17(41), pages 51-65, March.

    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.