IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v168y2006i3p716-731.html
   My bibliography  Save this article

An linear programming based lower bound for the simple assembly line balancing problem

Author

Listed:
  • Peeters, Marc
  • Degraeve, Zeger

Abstract

No abstract is available for this item.

Suggested Citation

  • Peeters, Marc & Degraeve, Zeger, 2006. "An linear programming based lower bound for the simple assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 168(3), pages 716-731, February.
    • Handle: RePEc:eee:ejores:v:168:y:2006:i:3:p:716-731
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00481-3
    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. Scholl, Armin & Klein, Robert, 1999. "Balancing assembly lines effectively - A computational comparison," European Journal of Operational Research, Elsevier, vol. 114(1), pages 50-58, April.
    2. Roger V. Johnson, 1988. "Optimally Balancing Large Assembly Lines with "Fable"," Management Science, INFORMS, vol. 34(2), pages 240-253, February.
    3. Steven T. Hackman & Michael J. Magazine & T. S. Wee, 1989. "Fast, Effective Algorithms for Simple Assembly Line Balancing Problems," Operations Research, INFORMS, vol. 37(6), pages 916-924, December.
    4. Armin Scholl & Robert Klein, 1997. "SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing," INFORMS Journal on Computing, INFORMS, vol. 9(4), pages 319-334, November.
    5. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(4), pages 691-705, August.
    6. Saltzman, Matthew J. & Baybars, Ilker, 1987. "A two-process implicit enumeration algorithm for the simple assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 32(1), pages 118-129, October.
    7. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(1), pages 225-228, February.
    8. F. Brian Talbot & James H. Patterson & William V. Gehrlein, 1986. "A Comparative Evaluation of Heuristic Line Balancing Techniques," Management Science, INFORMS, vol. 32(4), pages 430-454, April.
    9. Berger, Ilana & Bourjolly, Jean-Marie & Laporte, Gilbert, 1992. "Branch-and-bound algorithms for the multi-product assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 58(2), pages 215-222, April.
    10. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    11. Scholl, Armin, 1995. "Balancing and sequencing of assembly lines," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 9690, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    12. Thomas R. Hoffmann, 1992. "Eureka: A Hybrid System for Assembly Line Balancing," Management Science, INFORMS, vol. 38(1), pages 39-47, January.
    13. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(5), pages 879-883, October.
    14. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(6), pages 1195-1198, December.
    15. Scholl, Armin & Klein, Robert, 1997. "SALOME. a bidirectional branch and bound procedure for assembly line balancing," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 7890, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    16. Egon Balas & Maria C. Carrera, 1996. "A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering," Operations Research, INFORMS, vol. 44(6), pages 875-890, December.
    17. Zeger Degraeve & Marc Peeters, 2003. "Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 58-81, February.
    18. .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.
    19. Van Assche, F. & Herroelen, W. S., 1979. "An optimal procedure for the single-model deterministic assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 3(2), pages 142-149, March.
    20. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(2), pages 411-413, April.
    21. James R. Jackson, 1956. "A Computing Procedure for a Line Balancing Problem," Management Science, INFORMS, vol. 2(3), pages 261-271, April.
    22. Geon Cho & Dong X. Shaw, 1997. "A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 9(4), pages 431-438, 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. Pereira, Jordi & Álvarez-Miranda, Eduardo, 2018. "An exact approach for the robust assembly line balancing problem," Omega, Elsevier, vol. 78(C), pages 85-98.
    2. Orlando Rivera Letelier & François Clautiaux & Ruslan Sadykov, 2022. "Bin Packing Problem with Time Lags," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2249-2270, July.
    3. Shibasaki, Rui S. & Rossi, André & Gurevsky, Evgeny, 2024. "A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty," European Journal of Operational Research, Elsevier, vol. 313(3), pages 1015-1030.
    4. Pereira, Jordi, 2016. "Procedures for the bin packing problem with precedence constraints," European Journal of Operational Research, Elsevier, vol. 250(3), pages 794-806.
    5. Bautista, Joaquín & Pereira, Jordi, 2011. "Procedures for the Time and Space constrained Assembly Line Balancing Problem," European Journal of Operational Research, Elsevier, vol. 212(3), pages 473-481, August.
    6. Morrison, David R. & Sewell, Edward C. & Jacobson, Sheldon H., 2014. "An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset," European Journal of Operational Research, Elsevier, vol. 236(2), pages 403-409.

    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. 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.
    2. Scholl, Armin & Klein, Robert, 1999. "Balancing assembly lines effectively - A computational comparison," European Journal of Operational Research, Elsevier, vol. 114(1), pages 50-58, April.
    3. Scholl, Armin & Fliedner, Malte & Boysen, Nils, 2010. "Absalom: Balancing assembly lines with assignment restrictions," European Journal of Operational Research, Elsevier, vol. 200(3), pages 688-701, February.
    4. Fleszar, Krzysztof & Hindi, Khalil S., 2003. "An enumerative heuristic and reduction methods for the assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 145(3), pages 606-620, March.
    5. Sprecher, Arno, 2000. "SALBLIB: Challenging instances for assembly line balancing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 526, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. Vilà, Mariona & Pereira, Jordi, 2013. "An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time," European Journal of Operational Research, Elsevier, vol. 229(1), pages 106-113.
    7. 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.
    8. Klein, Robert & Scholl, Armin, 1996. "Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure," European Journal of Operational Research, Elsevier, vol. 91(2), pages 367-385, June.
    9. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    10. 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.
    11. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    12. B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
    13. Krzysztof C. Kiwiel, 2010. "An Inexact Bundle Approach to Cutting-Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 131-143, February.
    14. Huisman, D. & Jans, R.F. & Peeters, M. & Wagelmans, A.P.M., 2003. "Combining Column Generation and Lagrangian Relaxation," ERIM Report Series Research in Management ERS-2003-092-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    15. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    16. Bautista, Joaquín & Pereira, Jordi, 2011. "Procedures for the Time and Space constrained Assembly Line Balancing Problem," European Journal of Operational Research, Elsevier, vol. 212(3), pages 473-481, August.
    17. Tao Wu & Kerem Akartunal? & Raf Jans & Zhe Liang, 2017. "Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 523-543, August.
    18. Belov, G. & Scheithauer, G., 2006. "A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting," European Journal of Operational Research, Elsevier, vol. 171(1), pages 85-106, May.
    19. Aase, Gerald R. & Olson, John R. & Schniederjans, Marc J., 2004. "U-shaped assembly line layouts and their impact on labor productivity: An experimental study," European Journal of Operational Research, Elsevier, vol. 156(3), pages 698-711, August.
    20. Peeters, Marc & Degraeve, Zeger, 2006. "Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem," European Journal of Operational Research, Elsevier, vol. 170(2), pages 416-439, April.

    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:ejores:v:168:y:2006:i:3:p:716-731. 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/eor .

    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.