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

Backtracking of jobs in one-dimensional machine location problems

Author

Listed:
  • Sarker, Bhaba R.
  • Wilhelm, Wilbert E.
  • Hogg, Gary L.
  • Han, Min-Hong

Abstract

No abstract is available for this item.

Suggested Citation

  • Sarker, Bhaba R. & Wilhelm, Wilbert E. & Hogg, Gary L. & Han, Min-Hong, 1995. "Backtracking of jobs in one-dimensional machine location problems," European Journal of Operational Research, Elsevier, vol. 85(3), pages 593-609, September.
    • Handle: RePEc:eee:ejores:v:85:y:1995:i:3:p:593-609
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00008-Z
    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. Sunderesh S. Heragu & Andrew Kusiak, 1988. "Machine Layout Problem in Flexible Manufacturing Systems," Operations Research, INFORMS, vol. 36(2), pages 258-268, April.
    2. Zvi Drezner, 1980. "DISCON: A New Method for the Layout Problem," Operations Research, INFORMS, vol. 28(6), pages 1375-1384, December.
    3. Fred Glover, 1975. "Improved Linear Integer Programming Formulations of Nonlinear Integer Problems," Management Science, INFORMS, vol. 22(4), pages 455-460, December.
    4. Murtagh, B. A. & Jefferson, T. R. & Sornprasit, V., 1982. "A heuristic procedure for solving the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 9(1), pages 71-76, January.
    5. J. W. Gavett & Norman V. Plyter, 1966. "The Optimal Assignment of Facilities to Locations by Branch and Bound," Operations Research, INFORMS, vol. 14(2), pages 210-232, April.
    6. Jean-Claude Picard & Maurice Queyranne, 1981. "On the One-Dimensional Space Allocation Problem," Operations Research, INFORMS, vol. 29(2), pages 371-391, April.
    7. S. Saboo & L. Wang & W. E. Wilhelm, 1989. "Recursion Models for Describing and Managing the Transient Flow of Materials in Generalized Flowlines," Management Science, INFORMS, vol. 35(6), pages 722-742, June.
    8. Jadranka Skorin-Kapov, 1990. "Tabu Search Applied to the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 33-45, 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. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    2. Sarker, Bhaba R., 2003. "The effect of material flow and workload on the performance of machine location heuristics," European Journal of Operational Research, Elsevier, vol. 148(1), pages 166-191, July.
    3. Gong, Dijin & Yamazaki, Genji & Gen, Mitsuo & Xu, Weixuan, 1999. "A genetic algorithm method for one-dimensional machine location problems," International Journal of Production Economics, Elsevier, vol. 60(1), pages 337-342, April.
    4. Keller, Birgit & Buscher, Udo, 2015. "Single row layout models," European Journal of Operational Research, Elsevier, vol. 245(3), pages 629-644.
    5. Hassan, Mohsen M. D., 2000. "Toward re-engineering models and algorithms of facility layout," Omega, Elsevier, vol. 28(6), pages 711-723, December.
    6. A Diponegoro & B R Sarker, 2003. "Machine assignment in a nonlinear multi-product flowline," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(5), pages 472-489, May.
    7. Sarker, Bhaba R. & Wilhelm, Wilbert E. & Hogg, Gary L., 1998. "One-dimensional machine location problems in a multi-product flowline with equidistant locations," European Journal of Operational Research, Elsevier, vol. 105(3), pages 401-426, March.
    8. Diponegoro, Ahmad & Sarker, Bhaba R., 2003. "Flow distance reduction for a multi-product flowline with sets of identical machines," European Journal of Operational Research, Elsevier, vol. 147(3), pages 591-612, 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. Palubeckis, Gintaras, 2015. "Fast local search for single row facility layout," European Journal of Operational Research, Elsevier, vol. 246(3), pages 800-814.
    2. A Diponegoro & B R Sarker, 2003. "Machine assignment in a nonlinear multi-product flowline," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(5), pages 472-489, May.
    3. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    4. Dahlbeck, Mirko & Fischer, Anja & Fischer, Frank & Hungerländer, Philipp & Maier, Kerstin, 2023. "Exact approaches for the combined cell layout problem," European Journal of Operational Research, Elsevier, vol. 305(2), pages 530-546.
    5. Uma Kothari & Diptesh Ghosh, 2012. "A Competitive Genetic Algorithm for Single Row Facility Layout," Working Papers id:4915, eSocialSciences.
    6. Kothari, Ravi & Ghosh, Diptesh, 2013. "Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods," European Journal of Operational Research, Elsevier, vol. 224(1), pages 93-100.
    7. D. J. White, 1993. "A parametric‐based heuristic program for the quadratic assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(4), pages 553-568, June.
    8. André R. S. Amaral, 2008. "An Exact Approach to the One-Dimensional Facility Layout Problem," Operations Research, INFORMS, vol. 56(4), pages 1026-1033, August.
    9. Kothari, Ravi & Ghosh, Diptesh, 2012. "A Lin-Kernighan Heuristic for Single Row Facility Layout," IIMA Working Papers WP2012-01-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    10. Ravi Kumar, K. & Hadjinicola, George C. & Lin, Ting-li, 1995. "A heuristic procedure for the single-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 65-73, November.
    11. Guan, Jian & Lin, Geng, 2016. "Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem," European Journal of Operational Research, Elsevier, vol. 248(3), pages 899-909.
    12. Samarghandi, Hamed & Eshghi, Kourosh, 2010. "An efficient tabu algorithm for the single row facility layout problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 98-105, August.
    13. Philipp Hungerländer & Franz Rendl, 2013. "A computational study and survey of methods for the single-row facility layout problem," Computational Optimization and Applications, Springer, vol. 55(1), pages 1-20, May.
    14. Dahlbeck, Mirko, 2021. "A mixed-integer linear programming approach for the T-row and the multi-bay facility layout problem," European Journal of Operational Research, Elsevier, vol. 295(2), pages 443-462.
    15. Kothari, Ravi & Ghosh, Diptesh, 2012. "Tabu Search for the Single Row Facility Layout Problem in FMS using a 3-opt Neighborhood," IIMA Working Papers WP2012-02-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    16. Kothari, Ravi & Ghosh, Diptesh, 2012. "Scatter Search Algorithms for the Single Row Facility Layout Problem," IIMA Working Papers WP2012-04-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    17. Amaral, Andre R.S., 2006. "On the exact solution of a facility layout problem," European Journal of Operational Research, Elsevier, vol. 173(2), pages 508-518, September.
    18. Palubeckis, Gintaras, 2015. "Fast simulated annealing for single-row equidistant facility layout," Applied Mathematics and Computation, Elsevier, vol. 263(C), pages 287-301.
    19. Torki, Abdolhamid & Yajima, Yatsutoshi & Enkawa, Takao, 1996. "A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 384-391, October.
    20. A. R. S. Amaral, 2022. "A heuristic approach for the double row layout problem," Annals of Operations Research, Springer, vol. 316(2), pages 1-36, 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:ejores:v:85:y:1995:i:3:p:593-609. 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.