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

A beam search heuristic method for mixed-model scheduling with setups

Author

Listed:
  • McMullen, P.R.
  • Tarasewich, Peter

Abstract

No abstract is available for this item.

Suggested Citation

  • McMullen, P.R. & Tarasewich, Peter, 2005. "A beam search heuristic method for mixed-model scheduling with setups," International Journal of Production Economics, Elsevier, vol. 96(2), pages 273-283, May.
    • Handle: RePEc:eee:proeco:v:96:y:2005:i:2:p:273-283
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(04)00216-6
    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. Suresh K. Nair & Lakshman S. Thakur & Kuang-Wei Wen, 1995. "Near Optimal Solutions for Product Line Design and Selection: Beam Search Heuristics," Management Science, INFORMS, vol. 41(5), pages 767-785, May.
    2. Robert R. Inman & Robert L. Bulfin, 1991. "Note---Sequencing JIT Mixed-Model Assembly Lines," Management Science, INFORMS, vol. 37(7), pages 901-904, July.
    3. 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.
    4. 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.
    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. Sabuncuoglu, Ihsan & Gocgun, Yasin & Erel, Erdal, 2008. "Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling," European Journal of Operational Research, Elsevier, vol. 186(3), pages 915-930, May.
    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. 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.
    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. 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.
    6. Yavuz, Mesut & Tufekci, Suleyman, 2006. "A bounded dynamic programming solution to the batching problem in mixed-model just-in-time manufacturing systems," International Journal of Production Economics, Elsevier, vol. 103(2), pages 841-862, October.
    7. Asieh Varyani & Mohsen Salehi & Meysam Heydari Gharahcheshmeh, 2024. "Optimizing Mixed-Model Synchronous Assembly Lines with Bipartite Sequence-Dependent Setup Times in Advanced Manufacturing," Energies, MDPI, vol. 17(12), pages 1-20, June.

    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. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Wieslaw Kubiak & Mesut Yavuz, 2008. "Just-in-Time Smoothing Through Batching," Manufacturing & Service Operations Management, INFORMS, vol. 10(3), pages 506-518, June.
    7. Corominas, Albert & Kubiak, Wieslaw & Pastor, Rafael, 2010. "Mathematical programming modeling of the Response Time Variability Problem," European Journal of Operational Research, Elsevier, vol. 200(2), pages 347-357, January.
    8. Andreas Drexl & Alf Kimms, 2001. "Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints," Management Science, INFORMS, vol. 47(3), pages 480-491, March.
    9. Bautista, Joaquin & Companys, Ramon & Corominas, Albert, 2000. "Note on cyclic sequences in the product rate variation problem," European Journal of Operational Research, Elsevier, vol. 124(3), pages 468-477, August.
    10. Drexl, Andreas & Kimms, Alf, 1999. "Belastungsorientierte Just-in-Time Variantenfließfertigung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 502, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. 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.
    12. Matthießen, Lars & Drexl, Andreas & Kimms, Alf, 2000. "Constraint propagation algorithms for the car sequencing problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 531, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Fliedner, Malte & Boysen, Nils, 2008. "Solving the car sequencing problem via Branch & Bound," European Journal of Operational Research, Elsevier, vol. 191(3), pages 1023-1042, December.
    14. 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.
    15. 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.
    16. McMullen, Patrick R., 2001. "A Kohonen self-organizing map approach to addressing a multiple objective, mixed-model JIT sequencing problem," International Journal of Production Economics, Elsevier, vol. 72(1), pages 59-71, June.
    17. Lebacque, Vassilissa & Jost, Vincent & Brauner, Nadia, 2007. "Simultaneous optimization of classical objectives in JIT scheduling," European Journal of Operational Research, Elsevier, vol. 182(1), pages 29-39, October.
    18. Winfried Steiner & Harald Hruschka, 2002. "A Probabilistic One-Step Approach to the Optimal Product Line Design Problem Using Conjoint and Cost Data," Review of Marketing Science Working Papers 1-4-1003, Berkeley Electronic Press.
    19. Albert Corominas & Alberto García-Villoria & Rafael Pastor, 2013. "Metaheuristic algorithms hybridised with variable neighbourhood search for solving the response time variability problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(2), pages 296-312, July.
    20. Kim, Yeong-Dae & Lee, Dong-Ho & Yoon, Chi-Moon, 2001. "Two-stage heuristic algorithms for part input sequencing in flexible manufacturing systems," European Journal of Operational Research, Elsevier, vol. 133(3), pages 624-634, September.

    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:proeco:v:96:y:2005:i:2:p:273-283. 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.