IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v105y2007i2p372-384.html
   My bibliography  Save this article

Batch splitting in an assembly scheduling environment

Author

Listed:
  • Ghosh Dastidar, Satyaki
  • Nagi, Rakesh

Abstract

No abstract is available for this item.

Suggested Citation

  • Ghosh Dastidar, Satyaki & Nagi, Rakesh, 2007. "Batch splitting in an assembly scheduling environment," International Journal of Production Economics, Elsevier, vol. 105(2), pages 372-384, February.
    • Handle: RePEc:eee:proeco:v:105:y:2007:i:2:p:372-384
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(05)00235-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Dan Trietsch & Kenneth R. Baker, 1993. "Basic Techniques for Lot Streaming," Operations Research, INFORMS, vol. 41(6), pages 1065-1076, December.
    2. M. Florian & J. K. Lenstra & A. H. G. Rinnooy Kan, 1980. "Deterministic Production Planning: Algorithms and Complexity," Management Science, INFORMS, vol. 26(7), pages 669-679, July.
    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. Stan van Hoesel & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2005. "Integrated Lot Sizing in Serial Supply Chains with Production Capacities," Management Science, INFORMS, vol. 51(11), pages 1706-1719, November.
    2. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    3. Atamturk, Alper & Munoz, Juan Carlos, 2002. "A Study of the Lot-Sizing Polytope," University of California Transportation Center, Working Papers qt6zz2g0z4, University of California Transportation Center.
    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. Vernon Ning Hsu, 2000. "Dynamic Economic Lot Size Model with Perishable Inventory," Management Science, INFORMS, vol. 46(8), pages 1159-1169, August.
    6. Van Nieuwenhuyse, Inneke & Vandaele, Nico, 2004. "Determining the optimal number of sublots in a single-product, deterministic flow shop with overlapping operations," International Journal of Production Economics, Elsevier, vol. 92(3), pages 221-239, December.
    7. Sadok Rezig & Wajih Ezzeddine & Sadok Turki & Nidhal Rezg, 2020. "Mathematical Model for Production Plan Optimization—A Case Study of Discrete Event Systems," Mathematics, MDPI, vol. 8(6), pages 1-16, June.
    8. Pan, Zhendong & Tang, Jiafu & Liu, Ou, 2009. "Capacitated dynamic lot sizing problems in closed-loop supply chain," European Journal of Operational Research, Elsevier, vol. 198(3), pages 810-821, November.
    9. Ventura, José A. & Valdebenito, Victor A. & Golany, Boaz, 2013. "A dynamic inventory model with supplier selection in a serial supply chain structure," European Journal of Operational Research, Elsevier, vol. 230(2), pages 258-271.
    10. 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.
    11. Terzi, Mourad & Ouazene, Yassine & Yalaoui, Alice & Yalaoui, Farouk, 2023. "Lot-sizing and pricing decisions under attraction demand models and multi-channel environment: New efficient formulations," Operations Research Perspectives, Elsevier, vol. 10(C).
    12. Chung-Lun Li & Qingying Li, 2016. "Polynomial-Time Solvability of Dynamic Lot Size Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-20, June.
    13. Yilmaz, Dogacan & Büyüktahtakın, İ. Esra, 2024. "An expandable machine learning-optimization framework to sequential decision-making," European Journal of Operational Research, Elsevier, vol. 314(1), pages 280-296.
    14. Slama, Ilhem & Ben-Ammar, Oussama & Thevenin, Simon & Dolgui, Alexandre & Masmoudi, Faouzi, 2022. "Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1183-1198.
    15. Ravindra K. Ahuja & Dorit S. Hochbaum, 2008. "TECHNICAL NOTE---Solving Linear Cost Dynamic Lot-Sizing Problems in O ( n log n ) Time," Operations Research, INFORMS, vol. 56(1), pages 255-261, February.
    16. 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.
    17. Fink, Jiří & Hurink, Johann L., 2015. "Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses," European Journal of Operational Research, Elsevier, vol. 242(2), pages 644-650.
    18. Goisque, Guillaume & Rapine, Christophe, 2017. "An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels," European Journal of Operational Research, Elsevier, vol. 261(3), pages 918-928.
    19. Karel H. van Donselaar & Vishal Gaur & Tom van Woensel & Rob A. C. M. Broekmeulen & Jan C. Fransoo, 2010. "Ordering Behavior in Retail Stores and Implications for Automated Replenishment," Management Science, INFORMS, vol. 56(5), pages 766-784, May.
    20. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.

    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:eee:proeco:v:105:y:2007:i:2:p:372-384. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.