IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v57y2020i2d10.1007_s12597-019-00436-6.html
   My bibliography  Save this article

Applying available-to-promise (ATP) concept in mixed-model assembly line sequencing problems in a Make-To-Order (MTO) environment: problem extension, model formulation and Lagrangian relaxation algorithm

Author

Listed:
  • F. Tanhaie

    (University of Tehran)

  • M. Rabbani

    (University of Tehran)

  • N. Manavizadeh

    (Khatam University)

Abstract

Mixed-model assembly line is known to be a special case of production lines where variety of product models similar to product characteristics are assembled. This article addresses available-to-promise (ATP) in mixed-model assembly line sequencing problems in a Make-To-Order environment in two stages. First, the customers are prioritized based on their corresponding profit values and a decision support system for order acceptance/rejection based on ATP is developed. By implementing this concept and developing a mathematical model, delivery quantity and date in a planning horizon are determined based on the inventories in the stock. The second stage is solving a mixed binary mathematical model to sequence accepted orders suitably according to demands due dates that guarantees the orders are not released too late or too early. The problem simultaneously considers following objectives: minimizing the total tardiness and earliness costs based on the determined priority of orders and minimizing the utility work and idle time of workers in the production line. An algorithm based on Lagrangian relaxation is developed for the problem, and tested in terms of solution quality and computational efficiency. To validate the performance of the proposed algorithm, various test problems in small size are solved using the CPLEX solver, and compared with the Lagrangian relaxation method. Finally, the proposed model is solved in large size problems to analyze the model performance. The drawback of the CPLEX is that it could not solve large problem instances in reasonable time. For the small sized problem, there is approximately 1% duality gap for the Lagrangian relaxation method. The maximum duality gap in the Lagrangian relaxation method for the large sized problem is always kept below 4% while the average computing time is very reasonable. Therefore, according to the results obtained from test problems, the developed Lagrangian relaxation method proved to be the suitable method for this problem.

Suggested Citation

  • F. Tanhaie & M. Rabbani & N. Manavizadeh, 2020. "Applying available-to-promise (ATP) concept in mixed-model assembly line sequencing problems in a Make-To-Order (MTO) environment: problem extension, model formulation and Lagrangian relaxation algori," OPSEARCH, Springer;Operational Research Society of India, vol. 57(2), pages 320-346, June.
    • Handle: RePEc:spr:opsear:v:57:y:2020:i:2:d:10.1007_s12597-019-00436-6
    DOI: 10.1007/s12597-019-00436-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-019-00436-6
    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/s12597-019-00436-6?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. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    2. Tamura, Takayoshi & Long, Hong & Ohno, Katsuhisa, 1999. "A sequencing problem to level part usage rates and work loads for a mixed-model assembly line with a bypass subline," International Journal of Production Economics, Elsevier, vol. 60(1), pages 557-564, April.
    3. Nick T. Thomopoulos, 1967. "Line Balancing-Sequencing for Mixed-Model Assembly," Management Science, INFORMS, vol. 14(2), pages 59-75, October.
    4. Öner-Közen, Miray & Minner, Stefan, 2017. "Impact of priority sequencing decisions on on-time probability and expected tardiness of orders in make-to-order production systems with external due-dates," European Journal of Operational Research, Elsevier, vol. 263(2), pages 524-539.
    5. John Miltenburg, 1989. "Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems," Management Science, INFORMS, vol. 35(2), pages 192-207, February.
    6. Dobson, Gregory & Arai Yano, Candace, 1994. "Cyclic scheduling to minimize inventory in a batch flow line," European Journal of Operational Research, Elsevier, vol. 75(2), pages 441-461, June.
    7. Bautista, J. & Companys, R. & Corominas, A., 1996. "Heuristics and exact algorithms for solving the Monden problem," European Journal of Operational Research, Elsevier, vol. 88(1), pages 101-113, January.
    8. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2009. "Sequencing mixed-model assembly lines: Survey, classification and model critique," European Journal of Operational Research, Elsevier, vol. 192(2), pages 349-373, January.
    9. Jordi Pereira & Mariona Vilà, 2015. "An exact algorithm for the mixed-model level scheduling problem," International Journal of Production Research, Taylor & Francis Journals, vol. 53(19), pages 5809-5825, October.
    10. Xiaobo, Zhao & Ohno, Katsuhisa, 2000. "Properties of a sequencing problem for a mixed model assembly line with conveyor stoppages," European Journal of Operational Research, Elsevier, vol. 124(3), pages 560-570, August.
    11. J. L. C. Macaskill, 1973. "Computer Simulation for Mixed-Model Production Lines," Management Science, INFORMS, vol. 20(3), pages 341-348, November.
    12. Iman Ghalehkhondabi & Dusan Sormaz & Gary Weckman, 2016. "Multiple customer order decoupling points within a hybrid MTS/MTO manufacturing supply chain with uncertain demands in two consecutive echelons," OPSEARCH, Springer;Operational Research Society of India, vol. 53(4), pages 976-997, December.
    13. Abolfazl Jafari Asl & Maghsud Solimanpur & Ravi Shankar, 2019. "Multi-objective multi-model assembly line balancing problem: a quantitative study in engine manufacturing industry," OPSEARCH, Springer;Operational Research Society of India, vol. 56(3), pages 603-627, September.
    14. Korkmazel, Tugrul & Meral, Sedef, 2001. "Bicriteria sequencing methods for the mixed-model assembly line in just-in-time production systems," European Journal of Operational Research, Elsevier, vol. 131(1), pages 188-207, May.
    15. Bautista, Joaquín & Alfaro, Rocío & Batalla, Cristina, 2015. "Modeling and solving the mixed-model sequencing problem to improve productivity," International Journal of Production Economics, Elsevier, vol. 161(C), pages 83-95.
    16. Kinable, Joris & Cire, Andre A. & van Hoeve, Willem-Jan, 2017. "Hybrid optimization methods for time-dependent sequencing problems," European Journal of Operational Research, Elsevier, vol. 259(3), pages 887-897.
    17. G.J. Miltenburg & T. Goldstein, 1991. "Developing production schedules which balance part usage and smooth production loads for just‐in‐time production systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(6), pages 893-910, December.
    18. Mansouri, S. Afshin, 2005. "A Multi-Objective Genetic Algorithm for mixed-model sequencing on JIT assembly lines," European Journal of Operational Research, Elsevier, vol. 167(3), pages 696-716, December.
    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. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2009. "Sequencing mixed-model assembly lines: Survey, classification and model critique," European Journal of Operational Research, Elsevier, vol. 192(2), pages 349-373, January.
    2. Giard, Vincent & Jeunet, Jully, 2010. "Optimal sequencing of mixed models with sequence-dependent setups and utility workers on an assembly line," International Journal of Production Economics, Elsevier, vol. 123(2), pages 290-300, February.
    3. Ioanna Makarouni & John Psarras & Eleftherios Siskos, 2015. "Interactive bicriterion decision support for a large scale industrial scheduling system," Annals of Operations Research, Springer, vol. 227(1), pages 45-61, April.
    4. Ding, Fong-Yuen & Zhu, Jin & Sun, Hui, 2006. "Comparing two weighted approaches for sequencing mixed-model assembly lines with multiple objectives," International Journal of Production Economics, Elsevier, vol. 102(1), pages 108-131, July.
    5. Sadeghi, Parisa & Rebelo, Rui Diogo & Ferreira, José Soeiro, 2021. "Using variable neighbourhood descent and genetic algorithms for sequencing mixed-model assembly systems in the footwear industry," Operations Research Perspectives, Elsevier, vol. 8(C).
    6. Bautista, Joaquin & Cano, Jaime, 2008. "Minimizing work overload in mixed-model assembly lines," International Journal of Production Economics, Elsevier, vol. 112(1), pages 177-191, March.
    7. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2009. "The product rate variation problem and its relevance in real world mixed-model assembly lines," European Journal of Operational Research, Elsevier, vol. 197(2), pages 818-824, September.
    8. Bautista, Joaquín & Cano, Alberto & Alfaro, Rocío, 2012. "Models for MMSP-W considering workstation dependencies: A case study of Nissan’s Barcelona plant," European Journal of Operational Research, Elsevier, vol. 223(3), pages 669-679.
    9. Aigbedo, Henry, 2007. "An assessment of the effect of mass customization on suppliers' inventory levels in a JIT supply chain," European Journal of Operational Research, Elsevier, vol. 181(2), pages 704-715, September.
    10. Bautista, Joaquín & Cano, Alberto, 2011. "Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules," European Journal of Operational Research, Elsevier, vol. 210(3), pages 495-513, May.
    11. Boysen, Nils & Schulze, Philipp & Scholl, Armin, 2022. "Assembly line balancing: What happened in the last fifteen years?," European Journal of Operational Research, Elsevier, vol. 301(3), pages 797-814.
    12. Simon Emde & Lukas Polten, 2019. "Sequencing assembly lines to facilitate synchronized just-in-time part supply," Journal of Scheduling, Springer, vol. 22(6), pages 607-621, December.
    13. H. Mosadegh & S.M.T. Fatemi Ghomi & G.A. Süer, 2017. "Heuristic approaches for mixed-model sequencing problem with stochastic processing times," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2857-2880, May.
    14. Bautista, Joaquín & Alfaro, Rocío & Batalla, Cristina, 2015. "Modeling and solving the mixed-model sequencing problem to improve productivity," International Journal of Production Economics, Elsevier, vol. 161(C), pages 83-95.
    15. Baoxi Wang & Zailin Guan & Saif Ullah & Xianhao Xu & Zongdong He, 2017. "Simultaneous order scheduling and mixed-model sequencing in assemble-to-order production environment: a multi-objective hybrid artificial bee colony algorithm," Journal of Intelligent Manufacturing, Springer, vol. 28(2), pages 419-436, February.
    16. Drexl, Andreas & Jordan, Carsten, 1994. "Materialflußorientierte Produktionssteuerung bei Variantenfließfertigung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 362, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    17. Marshall L. Fisher & Christopher D. Ittner, 1999. "The Impact of Product Variety on Automobile Assembly Operations: Empirical Evidence and Simulation Analysis," Management Science, INFORMS, vol. 45(6), pages 771-786, June.
    18. Boysen, Nils & Scholl, Armin & Wopperer, Nico, 2012. "Resequencing of mixed-model assembly lines: Survey and research agenda," European Journal of Operational Research, Elsevier, vol. 216(3), pages 594-604.
    19. Ullah Saif & Zailin Guan & Li Zhang & Fei Zhang & Baoxi Wang & Jahanzaib Mirza, 2019. "Multi-objective artificial bee colony algorithm for order oriented simultaneous sequencing and balancing of multi-mixed model assembly line," Journal of Intelligent Manufacturing, Springer, vol. 30(3), pages 1195-1220, March.
    20. Caridi, Maria & Sianesi, Andrea, 2000. "Multi-agent systems in production planning and control: An application to the scheduling of mixed-model assembly lines," International Journal of Production Economics, Elsevier, vol. 68(1), pages 29-42, October.

    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:opsear:v:57:y:2020:i:2:d:10.1007_s12597-019-00436-6. 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.