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

Profitability of a multi-model manufacturing line versus multiple dedicated lines

Author

Listed:
  • Dolgui, Alexandre
  • Hashemi-Petroodi, S. Ehsan
  • Kovalev, Sergey
  • Kovalyov, Mikhail Y.

Abstract

We study a problem to decide which of the two manufacturing configurations – multiple dedicated lines or a single multi-model manufacturing line – is economically more preferable for manufacturing products of several types in a given time period. The goal of employing any of the two configurations is to maximize the total profit, subject to the product demand and manufacturing time constraints. The selection problem is reduced to two optimization problems, for one of which a polynomial time algorithm is developed, and NP-hardness is demonstrated for the other. A dynamic programming algorithm, a constructive greedy heuristic, a randomized heuristic and a local search algorithm with steepest ascent hill climbing are presented for the NP-hard problem. Computer experiments with the heuristics, local search algorithm and a commercial solver of the corresponding integer linear programming problem are described, which demonstrated appropriate quality of the heuristic and local search solutions. The proposed methodology and software can be used to evaluate different input data scenarios while making a selection decision between the two manufacturing configurations. The product demand and selling prices, setup and manufacturing times, demand and production cancellations are the parameters that affect the selection decision.

Suggested Citation

  • Dolgui, Alexandre & Hashemi-Petroodi, S. Ehsan & Kovalev, Sergey & Kovalyov, Mikhail Y., 2021. "Profitability of a multi-model manufacturing line versus multiple dedicated lines," International Journal of Production Economics, Elsevier, vol. 236(C).
    • Handle: RePEc:eee:proeco:v:236:y:2021:i:c:s092552732100089x
    DOI: 10.1016/j.ijpe.2021.108113
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S092552732100089X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2021.108113?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. Yoram Koren & Xi Gu & Weihong Guo, 2018. "Choosing the system configuration for high-volume manufacturing," International Journal of Production Research, Taylor & Francis Journals, vol. 56(1-2), pages 476-490, January.
    2. Dolgui, Alexandre & Kovalev, Sergey & Pesch, Erwin, 2015. "Approximate solution of a profit maximization constrained virtual business planning problem," Omega, Elsevier, vol. 57(PB), pages 212-216.
    3. Janiak, Adam & Kovalyov, Mikhail Y., 1996. "Single machine scheduling subject to deadlines and resource dependent processing times," European Journal of Operational Research, Elsevier, vol. 94(2), pages 284-291, October.
    4. Kück, Mirko & Freitag, Michael, 2021. "Forecasting of customer demands for production planning by local k-nearest neighbor models," International Journal of Production Economics, Elsevier, vol. 231(C).
    5. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    6. Baecke, Philippe & De Baets, Shari & Vanderheyden, Karlien, 2017. "Investigating the added value of integrating human judgement into statistical demand forecasting systems," International Journal of Production Economics, Elsevier, vol. 191(C), pages 85-96.
    7. Olga Battaïa & Alexandre Dolgui & Nikolai Guschinsky, 2020. "Optimal cost design of flow lines with reconfigurable machines for batch production," International Journal of Production Research, Taylor & Francis Journals, vol. 58(10), pages 2937-2952, May.
    8. Dombi, József & Jónás, Tamás & Tóth, Zsuzsanna Eszter, 2018. "Modeling and long-term forecasting demand in spare parts logistics businesses," International Journal of Production Economics, Elsevier, vol. 201(C), pages 1-17.
    9. Cabrera-Rios, Mauricio & Mount-Campbell, Clark A. & Irani, Shahrukh A., 2002. "An approach to the design of a manufacturing cell under economic considerations," International Journal of Production Economics, Elsevier, vol. 78(3), pages 223-237, August.
    10. Fandel, Günter & Lorth, Michael, 2009. "On the technical (in)efficiency of a profit maximum," International Journal of Production Economics, Elsevier, vol. 121(2), pages 409-426, October.
    11. Battaïa, Olga & Dolgui, Alexandre, 2013. "A taxonomy of line balancing problems and their solutionapproaches," International Journal of Production Economics, Elsevier, vol. 142(2), pages 259-277.
    12. Ortega Jimenez, Cesar H. & Machuca, Jose A.D. & Garrido-Vega, Pedro & Filippini, Roberto, 2015. "The pursuit of responsiveness in production environments: From flexibility to reconfigurability," International Journal of Production Economics, Elsevier, vol. 163(C), pages 157-172.
    13. 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.
    14. Rosling, Kaj, 1993. "A capacitated single-item lot-size model," International Journal of Production Economics, Elsevier, vol. 30(1), pages 213-219, July.
    15. Michael A. Greig & Judy Village & Filippo A. Salustri & Saeed Zolfaghari & W. Patrick Neumann, 2018. "A tool to predict physical workload and task times from workstation layout design data," International Journal of Production Research, Taylor & Francis Journals, vol. 56(16), pages 5306-5323, August.
    16. Lan, Chun-Hsiung, 2007. "The design of multiple production lines under deadline constraint," International Journal of Production Economics, Elsevier, vol. 106(1), pages 191-203, March.
    17. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    18. Chou, Jui-Sheng & Tai, Yian & Chang, Lian-Ji, 2010. "Predicting the development cost of TFT-LCD manufacturing equipment with artificial intelligence models," International Journal of Production Economics, Elsevier, vol. 128(1), pages 339-350, 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. Battaïa, Olga & Dolgui, Alexandre, 2022. "Hybridizations in line balancing problems: A comprehensive review on new trends and formulations," International Journal of Production Economics, Elsevier, vol. 250(C).
    2. Battaïa, Olga & Dolgui, Alexandre & Guschinsky, Nikolai, 2023. "MIP-based heuristics for combinatorial design of reconfigurable rotary transfer machines for production of multiple parts," International Journal of Production Economics, Elsevier, vol. 262(C).

    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. Battaïa, Olga & Dolgui, Alexandre, 2022. "Hybridizations in line balancing problems: A comprehensive review on new trends and formulations," International Journal of Production Economics, Elsevier, vol. 250(C).
    2. Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y. & Nossack, Jenny & Pesch, Erwin, 2014. "Minimizing setup costs in a transfer line design problem with sequential operation processing," International Journal of Production Economics, Elsevier, vol. 151(C), pages 186-194.
    3. Shi-Sheng Li & Ren-Xia Chen & Qi Feng, 2016. "Scheduling two job families on a single machine with two competitive agents," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 784-799, October.
    4. Cheng, T. C. Edwin & Janiak, Adam & Kovalyov, Mikhail Y., 2001. "Single machine batch scheduling with resource dependent setup and processing times," European Journal of Operational Research, Elsevier, vol. 135(1), pages 177-183, November.
    5. A. Dolgui & M. Kovalyov & K. Shchamialiova, 2011. "Multi-product lot-sizing and sequencing on a single imperfect machine," Computational Optimization and Applications, Springer, vol. 50(3), pages 465-482, December.
    6. Hinder, Oliver & Mason, Andrew J., 2017. "A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness," European Journal of Operational Research, Elsevier, vol. 262(2), pages 411-423.
    7. Xiangtong Qi, 2005. "A logistics scheduling model: Inventory cost reduction by batching," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 312-320, June.
    8. Kramer, Arthur & Iori, Manuel & Lacomme, Philippe, 2021. "Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization," European Journal of Operational Research, Elsevier, vol. 289(3), pages 825-840.
    9. Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Group scheduling and due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 130(2), pages 230-235, April.
    10. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    11. Sanja Petrovic & Carole Fayad & Dobrila Petrovic & Edmund Burke & Graham Kendall, 2008. "Fuzzy job shop scheduling with lot-sizing," Annals of Operations Research, Springer, vol. 159(1), pages 275-292, March.
    12. Ji, Min & Cheng, T.C.E., 2010. "Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan," European Journal of Operational Research, Elsevier, vol. 202(1), pages 90-98, April.
    13. Lele Zhang & Andrew Wirth, 2016. "Online Machine Scheduling with Family Setups," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-16, August.
    14. Florian Jaehn & Sergey Kovalev & Mikhail Y. Kovalyov & Erwin Pesch, 2014. "Multiproduct batching and scheduling with buffered rework: The case of a car paint shop," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(6), pages 458-471, September.
    15. Jinwen Ou, 2020. "Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection," Journal of Scheduling, Springer, vol. 23(5), pages 525-538, October.
    16. Dominik Kress & Sebastian Meiswinkel & Erwin Pesch, 2018. "Mechanism design for machine scheduling problems: classification and literature overview," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 583-611, July.
    17. Mao, Zhaofang & Sun, Yiting & Fang, Kan & Huang, Dian & Zhang, Jiaxin, 2024. "Balancing and scheduling of assembly line with multi-type collaborative robots," International Journal of Production Economics, Elsevier, vol. 271(C).
    18. Pang, King-Wah, 2013. "A genetic algorithm based heuristic for two machine no-wait flowshop scheduling problems with class setup times that minimizes maximum lateness," International Journal of Production Economics, Elsevier, vol. 141(1), pages 127-136.
    19. David Conradie & Leilani Morison & Johan Joubert, 2008. "Scheduling at coal handling facilities using Simulated Annealing," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(2), pages 277-293, October.
    20. Gribkovskaia, Irina V. & Kovalev, Sergey & Werner, Frank, 2010. "Batching for work and rework processes on dedicated facilities to minimize the makespan," Omega, Elsevier, vol. 38(6), pages 522-527, December.

    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:236:y:2021:i:c:s092552732100089x. 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.