IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v32y2021i7d10.1007_s10845-020-01728-1.html
   My bibliography  Save this article

Regenerative scheduling problem in engineer to order manufacturing: an economic assessment

Author

Listed:
  • R. Micale

    (University of Palermo)

  • C. M. La Fata

    (University of Palermo)

  • M. Enea

    (University of Palermo)

  • G. La Scalia

    (University of Palermo)

Abstract

The dynamic production scheduling is a very complex process that may arise from the occurrence of unpredictable situations such as the arrival of new orders besides the ones already accepted. As a consequence, companies may often encounter several difficulties to make decisions about the new orders acceptance and sequencing along with the production of the existing ones. With this recognition, a mathematical programming model for the regenerative scheduling problem with deterministic processing times is formulated in the present paper to evaluate the economic advantage of accepting a new order in an engineer to order (ETO) manufacturing organization. The real case of an Italian ETO company which produces hydraulic marine and offshore cranes is afterwards presented.

Suggested Citation

  • R. Micale & C. M. La Fata & M. Enea & G. La Scalia, 2021. "Regenerative scheduling problem in engineer to order manufacturing: an economic assessment," Journal of Intelligent Manufacturing, Springer, vol. 32(7), pages 1913-1925, October.
    • Handle: RePEc:spr:joinma:v:32:y:2021:i:7:d:10.1007_s10845-020-01728-1
    DOI: 10.1007/s10845-020-01728-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-020-01728-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10845-020-01728-1?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. Philipp Melchiors & Roel Leus & Stefan Creemers & Rainer Kolisch, 2018. "Dynamic order acceptance and capacity planning in a stochastic multi-project environment with a bottleneck resource," International Journal of Production Research, Taylor & Francis Journals, vol. 56(1-2), pages 459-475, January.
    2. Gosling, Jonathan & Naim, Mohamed M., 2009. "Engineer-to-order supply chain management: A literature review and research agenda," International Journal of Production Economics, Elsevier, vol. 122(2), pages 741-754, December.
    3. Basso, Franco & Guajardo, Mario & Varas, Mauricio, 2020. "Collaborative job scheduling in the wine bottling process," Omega, Elsevier, vol. 91(C).
    4. Venkata Prasad Palakiti & Usha Mohan & Viswanath Kumar Ganesan, 2019. "Order acceptance and scheduling: overview and complexity results," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 34(3), pages 369-386.
    5. Bertrand, J. W. M. & Muntslag, D. R., 1993. "Production control in engineer-to-order firms," International Journal of Production Economics, Elsevier, vol. 30(1), pages 3-22, July.
    6. Esmaeilbeigi, Rasul & Charkhgard, Parisa & Charkhgard, Hadi, 2016. "Order acceptance and scheduling problems in two-machine flow shops: New mixed integer programming formulations," European Journal of Operational Research, Elsevier, vol. 251(2), pages 419-431.
    7. Hongfeng Wang & Min Huang & Junwei Wang, 2019. "An effective metaheuristic algorithm for flowshop scheduling with deteriorating jobs," Journal of Intelligent Manufacturing, Springer, vol. 30(7), pages 2733-2742, October.
    8. Ou, Jinwen & Zhong, Xueling & Wang, Guoqing, 2015. "An improved heuristic for parallel machine scheduling with rejection," European Journal of Operational Research, Elsevier, vol. 241(3), pages 653-661.
    9. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, May.
    10. Zhi Li & Ali Vatankhah Barenji & Jiazhi Jiang & Ray Y. Zhong & Gangyan Xu, 2020. "A mechanism for scheduling multi robot intelligent warehouse system face with dynamic demand," Journal of Intelligent Manufacturing, Springer, vol. 31(2), pages 469-480, February.
    11. Lee, Younsoo & Lee, Kyungsik, 2020. "Lot-sizing and scheduling in flat-panel display manufacturing process," Omega, Elsevier, vol. 93(C).
    12. Artigues, Christian & Michelon, Philippe & Reusser, Stephane, 2003. "Insertion techniques for static and dynamic resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 149(2), pages 249-267, September.
    13. Shih-Hsin Chen & Yeong-Cheng Liou & Yi-Hui Chen & Kun-Ching Wang, 2019. "Order Acceptance and Scheduling Problem with Carbon Emission Reduction and Electricity Tariffs on a Single Machine," Sustainability, MDPI, vol. 11(19), pages 1-16, September.
    14. Jade Herbots & Willy Herroelen & Roel Leus, 2007. "Dynamic order acceptance and capacity planning on a single bottleneck resource," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(8), pages 874-889, December.
    15. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    16. Jian Zhang & Guofu Ding & Yisheng Zou & Shengfeng Qin & Jianlin Fu, 2019. "Review of job shop scheduling research and its new perspectives under Industry 4.0," Journal of Intelligent Manufacturing, Springer, vol. 30(4), pages 1809-1830, April.
    17. Paz Perez-Gonzalez & Jose M. Framinan, 2015. "Assessing scheduling policies in a permutation flowshop with common due dates," International Journal of Production Research, Taylor & Francis Journals, vol. 53(19), pages 5742-5754, October.
    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. Wenkang Zhang & Yufan Zheng & Rafiq Ahmad, 2023. "The integrated process planning and scheduling of flexible job-shop-type remanufacturing systems using improved artificial bee colony algorithm," Journal of Intelligent Manufacturing, Springer, vol. 34(7), pages 2963-2988, October.

    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. Tarhan, İstenç & Oğuz, Ceyda, 2022. "A matheuristic for the generalized order acceptance and scheduling problem," European Journal of Operational Research, Elsevier, vol. 299(1), pages 87-103.
    2. Xin Li & José A. Ventura & Kevin A. Bunn, 2021. "A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime," Journal of Scheduling, Springer, vol. 24(1), pages 49-68, February.
    3. Li, Xin & Ventura, Jose A., 2020. "Exact algorithms for a joint order acceptance and scheduling problem," International Journal of Production Economics, Elsevier, vol. 223(C).
    4. Wang, Xiuli & Geng, Sujie & Cheng, T.C.E., 2018. "Negotiation mechanisms for an order subcontracting and scheduling problem," Omega, Elsevier, vol. 77(C), pages 154-167.
    5. Shih-Hsin Chen & Yeong-Cheng Liou & Yi-Hui Chen & Kun-Ching Wang, 2019. "Order Acceptance and Scheduling Problem with Carbon Emission Reduction and Electricity Tariffs on a Single Machine," Sustainability, MDPI, vol. 11(19), pages 1-16, September.
    6. Wang, Xiuli & Cheng, T.C.E., 2015. "A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint," International Journal of Production Economics, Elsevier, vol. 161(C), pages 74-82.
    7. Wang, Xiuli & Zhu, Qianqian & Cheng, T.C.E., 2015. "Subcontracting price schemes for order acceptance and scheduling," Omega, Elsevier, vol. 54(C), pages 1-10.
    8. Zhong, Xueling & Ou, Jinwen & Wang, Guoqing, 2014. "Order acceptance and scheduling with machine availability constraints," European Journal of Operational Research, Elsevier, vol. 232(3), pages 435-441.
    9. Sandrin, Enrico & Trentin, Alessio & Forza, Cipriano, 2018. "Leveraging high-involvement practices to develop mass customization capability: A contingent configurational perspective," International Journal of Production Economics, Elsevier, vol. 196(C), pages 335-345.
    10. Wang, Xiuli & Xie, Xingzi & Cheng, T.C.E., 2013. "Order acceptance and scheduling in a two-machine flowshop," International Journal of Production Economics, Elsevier, vol. 141(1), pages 366-376.
    11. Daniela D. Viana & Iris D. Tommelein & Carlos T. Formoso, 2017. "Using Modularity to Reduce Complexity of Industrialized Building Systems for Mass Customization," Energies, MDPI, vol. 10(10), pages 1-17, October.
    12. Ou, Jinwen & Zhong, Xueling, 2017. "Bicriteria order acceptance and scheduling with consideration of fill rate," European Journal of Operational Research, Elsevier, vol. 262(3), pages 904-907.
    13. Chen, Heng & Hu, Zhangchen & Solak, Senay, 2021. "Improved delivery policies for future drone-based delivery systems," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1181-1201.
    14. Simon Thevenin & Nicolas Zufferey & Marino Widmer, 2016. "Order acceptance and scheduling with earliness and tardiness penalties," Journal of Heuristics, Springer, vol. 22(6), pages 849-890, December.
    15. Lei He & Mathijs Weerdt & Neil Yorke-Smith, 2020. "Time/sequence-dependent scheduling: the design and evaluation of a general purpose tabu-based adaptive large neighbourhood search algorithm," Journal of Intelligent Manufacturing, Springer, vol. 31(4), pages 1051-1078, April.
    16. Perea, Federico & Yepes-Borrero, Juan C. & Menezes, Mozart B.C., 2023. "Acceptance Ordering Scheduling Problem: The impact of an order-portfolio on a make-to-order firm’s profitability," International Journal of Production Economics, Elsevier, vol. 264(C).
    17. Hanane Krim & Nicolas Zufferey & Jean-Yves Potvin & Rachid Benmansour & David Duvivier, 2022. "Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times," Journal of Scheduling, Springer, vol. 25(1), pages 89-105, February.
    18. Zhong, Xueling & Fan, Jie & Ou, Jinwen, 2022. "Coordinated scheduling of the outsourcing, in-house production and distribution operations," European Journal of Operational Research, Elsevier, vol. 302(2), pages 427-437.
    19. Xiao, Yiyong & Yuan, Yingying & Zhang, Ren-Qian & Konak, Abdullah, 2015. "Non-permutation flow shop scheduling with order acceptance and weighted tardiness," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 312-333.
    20. Joonyup Eun & Chang Sup Sung & Eun-Seok Kim, 2017. "Maximizing total job value on a single machine with job selection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 998-1005, September.

    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:joinma:v:32:y:2021:i:7:d:10.1007_s10845-020-01728-1. 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.