IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v60y2009i3d10.1057_palgrave.jors.2602533.html
   My bibliography  Save this article

Searching optimal resequencing and feature assignment on an automated assembly line

Author

Listed:
  • A Lim

    (City University of Hong Kong)

  • Z Xu

    (The Hong Kong Polytechnic University)

Abstract

The resequencing and feature assignment problem (RFAP) appears among jobs in the assembly line, especially in the automotive industry. Each job in the assembly line must be assigned a feature from its feasible feature set. However, a changeover cost is incurred between two consecutive jobs with different features. To minimize the total changeover cost, the job sequence needs to be rearranged, but the rearrangement is restricted to the number of offline buffers. The RFAP turns out to be 𝒩𝒫-hard in the strong sense. Based on a beam search heuristic to generate upper bounds of optimum solutions, we have proposed an iterative search scheme which can achieve optimum solutions in a reasonably short time, for cases sized as large as that in reality. Extensive experiments have shown very favourable results for our methods in terms of both the solution quality and the time efficiency.

Suggested Citation

  • A Lim & Z Xu, 2009. "Searching optimal resequencing and feature assignment on an automated assembly line," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(3), pages 361-371, March.
    • Handle: RePEc:pal:jorsoc:v:60:y:2009:i:3:d:10.1057_palgrave.jors.2602533
    DOI: 10.1057/palgrave.jors.2602533
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602533
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602533?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. Candace Arai Yano & Ram Rachamadugu, 1991. "Sequencing to Minimize Work Overload in Assembly Lines with Product Options," Management Science, INFORMS, vol. 37(5), pages 572-586, May.
    2. .Ilker Baybars, 1986. "A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem," Management Science, INFORMS, vol. 32(8), pages 909-932, August.
    3. Egon Balas & Neil Simonetti, 2001. "Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study," INFORMS Journal on Computing, INFORMS, vol. 13(1), pages 56-75, February.
    4. Chung-Yee Lee & George L. Vairaktarakis, 1997. "Workforce Planning in Mixed Model Assembly Systems," Operations Research, INFORMS, vol. 45(4), pages 553-567, August.
    5. F Della Croce & V T'kindt, 2002. "A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(11), pages 1275-1280, 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. 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.
    2. M Ozlen & M Azizoğlu, 2011. "Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 152-164, January.
    3. Taube, F. & Minner, S., 2018. "Resequencing mixed-model assembly lines with restoration to customer orders," Omega, Elsevier, vol. 78(C), pages 99-111.

    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. Heike, G. & Ramulu, M. & Sorenson, E. & Shanahan, P. & Moinzadeh, K., 2001. "Mixed model assembly alternatives for low-volume manufacturing: The case of the aerospace industry," International Journal of Production Economics, Elsevier, vol. 72(2), pages 103-120, July.
    2. Jérémie Gallien & Serguei Netessine & Maher Lahmar & Hakan Ergan & Sergei V. Savin & Michael J. Fry, 2001. "The MSOM Society Student Paper Competition: Extended Abstracts of 2000 Winners," Manufacturing & Service Operations Management, INFORMS, vol. 3(1), pages 1-1.
    3. Xiaobo Zhao & Katsuhisa Ohno & Hon‐Shiang Lau, 2004. "A balancing problem for mixed model assembly lines with a paced moving conveyor," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(3), pages 446-464, April.
    4. 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.
    5. Xiaobo Zhao & Jianyong Liu & Katsuhisa Ohno & Shigenori Kotani, 2007. "Modeling and analysis of a mixed‐model assembly line with stochastic operation times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(6), pages 681-691, September.
    6. Filippo Focacci & Andrea Lodi & Michela Milano, 2002. "A Hybrid Exact Algorithm for the TSPTW," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 403-417, November.
    7. Roberto Baldacci & Aristide Mingozzi & Roberto Roberti, 2012. "New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 356-371, August.
    8. 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.
    9. Becker, Christian & Scholl, Armin, 2006. "A survey on problems and methods in generalized assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 694-715, February.
    10. Sanjeeb Dash & Oktay Günlük & Andrea Lodi & Andrea Tramontani, 2012. "A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 132-147, February.
    11. Pape, Tom, 2015. "Heuristics and lower bounds for the simple assembly line balancing problem type 1: Overview, computational tests and improvements," European Journal of Operational Research, Elsevier, vol. 240(1), pages 32-42.
    12. Walter, Rico & Schulze, Philipp & Scholl, Armin, 2021. "SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 295(3), pages 857-873.
    13. Moreira, Mayron César O. & Costa, Alysson M., 2013. "Hybrid heuristics for planning job rotation schedules in assembly lines with heterogeneous workers," International Journal of Production Economics, Elsevier, vol. 141(2), pages 552-560.
    14. García-Villoria, Alberto & Corominas, Albert & Nadal, Adrià & Pastor, Rafael, 2018. "Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints," European Journal of Operational Research, Elsevier, vol. 271(3), pages 882-895.
    15. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    16. Ece Sancı & Meral Azizoğlu, 2017. "Rebalancing the assembly lines: exact solution approaches," International Journal of Production Research, Taylor & Francis Journals, vol. 55(20), pages 5991-6010, October.
    17. Roberti, R. & Wen, M., 2016. "The Electric Traveling Salesman Problem with Time Windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 32-52.
    18. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    19. Borba, Leonardo & Ritt, Marcus & Miralles, Cristóbal, 2018. "Exact and heuristic methods for solving the Robotic Assembly Line Balancing Problem," European Journal of Operational Research, Elsevier, vol. 270(1), pages 146-156.
    20. Timo Hintsch, 2019. "Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem," Working Papers 1904, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.

    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:pal:jorsoc:v:60:y:2009:i:3:d:10.1057_palgrave.jors.2602533. 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.palgrave-journals.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.