IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v173y2006i1p173-189.html
   My bibliography  Save this article

A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains

Author

Listed:
  • Torabi, S.A.
  • Fatemi Ghomi, S.M.T.
  • Karimi, B.

Abstract

No abstract is available for this item.

Suggested Citation

  • Torabi, S.A. & Fatemi Ghomi, S.M.T. & Karimi, B., 2006. "A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains," European Journal of Operational Research, Elsevier, vol. 173(1), pages 173-189, August.
    • Handle: RePEc:eee:ejores:v:173:y:2006:i:1:p:173-189
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00855-0
    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. Brah, Shaukat A. & Loo, Luan Luan, 1999. "Heuristics for scheduling in a flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 113(1), pages 113-122, February.
    2. Liaw, Ching-Fang, 2000. "A hybrid genetic algorithm for the open shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 124(1), pages 28-42, July.
    3. Wardono, Bagas & Fathi, Yahya, 2004. "A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities," European Journal of Operational Research, Elsevier, vol. 155(2), pages 380-401, June.
    4. Jensen, Mikkel T. & Khouja, Moutaz, 2004. "An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem," European Journal of Operational Research, Elsevier, vol. 156(2), pages 305-311, July.
    5. Taillard, E., 1990. "Some efficient heuristic methods for the flow shop sequencing problem," European Journal of Operational Research, Elsevier, vol. 47(1), pages 65-74, July.
    6. Hahm, Juho & Yano, Candace Arai, 1992. "The economic lot and delivery scheduling problem: The single item case," International Journal of Production Economics, Elsevier, vol. 28(2), pages 235-252, November.
    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. Ventura, José A. & Bunn, Kevin A. & Venegas, Bárbara B. & Duan, Lisha, 2021. "A coordination mechanism for supplier selection and order quantity allocation with price-sensitive demand and finite production rates," International Journal of Production Economics, Elsevier, vol. 233(C).
    2. B.‐Y. Cheng & J.Y.‐T. Leung & K. Li & S.‐L. Yang, 2015. "Single batch machine scheduling with deliveries," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(6), pages 470-482, September.
    3. Osman, Hany & Demirli, Kudret, 2012. "Economic lot and delivery scheduling problem for multi-stage supply chains," International Journal of Production Economics, Elsevier, vol. 136(2), pages 275-286.
    4. Peng, Peng & Snyder, Lawrence V. & Lim, Andrew & Liu, Zuli, 2011. "Reliable logistics networks design with facility disruptions," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1190-1211, September.
    5. Garn, Wolfgang & Aitken, James, 2015. "Agile factorial production for a single manufacturing line with multiple products," European Journal of Operational Research, Elsevier, vol. 245(3), pages 754-766.
    6. Osman, Hany & Demirli, Kudret, 2012. "Integrated safety stock optimization for multiple sourced stockpoints facing variable demand and lead time," International Journal of Production Economics, Elsevier, vol. 135(1), pages 299-307.
    7. Deyun Wang & Olivier Grunder & Abdellah EL Moudni, 2014. "Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(8), pages 1694-1707, August.

    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. Clausen, Jens & Ju, Suquan, 2006. "A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1141-1150, December.
    2. Pundoor, Guruprasad & Chen, Zhi-Long, 2009. "Joint cyclic production and delivery scheduling in a two-stage supply chain," International Journal of Production Economics, Elsevier, vol. 119(1), pages 55-74, May.
    3. Quadt, Daniel & Kuhn, Heinrich, 2007. "Batch scheduling of jobs with identical process times on flexible flow lines," International Journal of Production Economics, Elsevier, vol. 105(2), pages 385-401, February.
    4. Quadt, Daniel & Kuhn, Heinrich, 2007. "A taxonomy of flexible flow line scheduling procedures," European Journal of Operational Research, Elsevier, vol. 178(3), pages 686-698, May.
    5. Tseng, Lin-Yu & Lin, Ya-Tai, 2010. "A hybrid genetic algorithm for no-wait flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 128(1), pages 144-152, November.
    6. Osman, Hany & Demirli, Kudret, 2012. "Economic lot and delivery scheduling problem for multi-stage supply chains," International Journal of Production Economics, Elsevier, vol. 136(2), pages 275-286.
    7. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    8. Osman, Hany & Demirli, Kudret, 2012. "Integrated safety stock optimization for multiple sourced stockpoints facing variable demand and lead time," International Journal of Production Economics, Elsevier, vol. 135(1), pages 299-307.
    9. Kai-Leung Yung & Jiafu Tang & Andrew W. H. Ip & Dingwei Wang, 2006. "Heuristics for Joint Decisions in Production, Transportation, and Order Quantity," Transportation Science, INFORMS, vol. 40(1), pages 99-116, February.
    10. Shahaboddin Shamshirband & Mohammad Shojafar & A. Hosseinabadi & Maryam Kardgar & M. Nasir & Rodina Ahmad, 2015. "OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises," Annals of Operations Research, Springer, vol. 229(1), pages 743-758, June.
    11. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    12. Chen, Chuen-Lung & Vempati, Venkateswara S. & Aljaber, Nasser, 1995. "An application of genetic algorithms for flow shop problems," European Journal of Operational Research, Elsevier, vol. 80(2), pages 389-396, January.
    13. Solimanpur, M. & Vrat, Prem & Shankar, Ravi, 2004. "A heuristic to minimize makespan of cell scheduling problem," International Journal of Production Economics, Elsevier, vol. 88(3), pages 231-241, April.
    14. L Tang & H Xuan, 2006. "Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 316-324, March.
    15. Barry B. & Quim Castellà & Angel A. & Helena Ramalhinho Lourenco & Manuel Mateo, 2012. "ILS-ESP: An Efficient, Simple, and Parameter-Free Algorithm for Solving the Permutation Flow-Shop Problem," Working Papers 636, Barcelona School of Economics.
    16. Brammer, Janis & Lutz, Bernhard & Neumann, Dirk, 2022. "Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 75-86.
    17. Ganesan, Viswanath Kumar & Sivakumar, Appa Iyer, 2006. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times," International Journal of Production Economics, Elsevier, vol. 103(2), pages 633-647, October.
    18. Pan, Quan-Ke & Ruiz, Rubén, 2012. "Local search methods for the flowshop scheduling problem with flowtime minimization," European Journal of Operational Research, Elsevier, vol. 222(1), pages 31-43.
    19. Naderi, B. & Zandieh, M., 2014. "Modeling and scheduling no-wait open shop problems," International Journal of Production Economics, Elsevier, vol. 158(C), pages 256-266.
    20. Tseng, Lin-Yu & Lin, Ya-Tai, 2009. "A hybrid genetic local search algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 84-92, October.

    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:ejores:v:173:y:2006:i:1:p:173-189. 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/eor .

    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.