IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v38y1995i2-3p133-145.html
   My bibliography  Save this article

Combined heuristics for bi-level group scheduling problems

Author

Listed:
  • Logendran, Rasaratnam
  • Mai, Luen
  • Talkington, Diane

Abstract

No abstract is available for this item.

Suggested Citation

  • Logendran, Rasaratnam & Mai, Luen & Talkington, Diane, 1995. "Combined heuristics for bi-level group scheduling problems," International Journal of Production Economics, Elsevier, vol. 38(2-3), pages 133-145, March.
    • Handle: RePEc:eee:proeco:v:38:y:1995:i:2-3:p:133-145
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0925-5273(94)00083-M
    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. Logendran, Rasaratnam & Nudtasomboon, Nudtapon, 1991. "Minimizing the makespan of a group scheduling problem: a new heuristic," International Journal of Production Economics, Elsevier, vol. 22(3), pages 217-230, December.
    2. Nawaz, Muhammad & Enscore Jr, E Emory & Ham, Inyong, 1983. "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," Omega, Elsevier, vol. 11(1), pages 91-95.
    3. David G. Dannenbring, 1977. "An Evaluation of Flow Shop Sequencing Heuristics," Management Science, INFORMS, vol. 23(11), pages 1174-1182, July.
    4. Herbert G. Campbell & Richard A. Dudek & Milton L. Smith, 1970. "A Heuristic Algorithm for the n Job, m Machine Sequencing Problem," Management Science, INFORMS, vol. 16(10), pages 630-637, June.
    5. Logendran, Rasaratnam & Sriskandarajah, Chelliah, 1993. "Two-machine group scheduling problem with blocking and anticipatory setups," European Journal of Operational Research, Elsevier, vol. 69(3), pages 467-481, September.
    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. Solimanpur, Maghsud & Elmi, Atabak, 2013. "A tabu search approach for cell scheduling problem with makespan criterion," International Journal of Production Economics, Elsevier, vol. 141(2), pages 639-645.
    2. Bozorgirad, Mir Abbas & Logendran, Rasaratnam, 2013. "Bi-criteria group scheduling in hybrid flowshops," International Journal of Production Economics, Elsevier, vol. 145(2), pages 599-612.
    3. Logendran, Rasaratnam & deSzoeke, Paula & Barnard, Faith, 2006. "Sequence-dependent group scheduling problems in flexible flow shops," International Journal of Production Economics, Elsevier, vol. 102(1), pages 66-86, July.
    4. Solimanpur, M. & Vrat, Prem & Shankar, Ravi, 2004. "A heuristic to minimize makespan of cell scheduling problem," International Journal of Production Economics, Elsevier, vol. 88(3), pages 231-241, April.
    5. Antonio Costa & Fulvio Antonio Cappadonna & Sergio Fichera, 2017. "A hybrid genetic algorithm for minimizing makespan in a flow-shop sequence-dependent group scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 28(6), pages 1269-1283, August.
    6. Logendran, Rasaratnam & Carson, Sara & Hanson, Erik, 2005. "Group scheduling in flexible flow shops," International Journal of Production Economics, Elsevier, vol. 96(2), pages 143-155, May.
    7. Zhuang Huang & Jianjun Yang, 2020. "Scheduling Optimization in Flowline Manufacturing Cell Considering Intercell Movement with Harmony Search Approach," Mathematics, MDPI, vol. 8(12), pages 1-21, December.

    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. Solimanpur, M. & Vrat, Prem & Shankar, Ravi, 2004. "A heuristic to minimize makespan of cell scheduling problem," International Journal of Production Economics, Elsevier, vol. 88(3), pages 231-241, April.
    2. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    3. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    4. Tseng, Lin-Yu & Lin, Ya-Tai, 2009. "A hybrid genetic local search algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 84-92, October.
    5. Kalczynski, Pawel Jan & Kamburowski, Jerzy, 2007. "On the NEH heuristic for minimizing the makespan in permutation flow shops," Omega, Elsevier, vol. 35(1), pages 53-60, February.
    6. Schaller, Jeffrey E. & Gupta, Jatinder N. D. & Vakharia, Asoo J., 2000. "Scheduling a flowline manufacturing cell with sequence dependent family setup times," European Journal of Operational Research, Elsevier, vol. 125(2), pages 324-339, September.
    7. Smutnicki, Czeslaw, 1998. "Some results of the worst-case analysis for flow shop scheduling," European Journal of Operational Research, Elsevier, vol. 109(1), pages 66-87, August.
    8. Ben-Daya, M. & Al-Fawzan, M., 1998. "A tabu search approach for the flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 109(1), pages 88-95, August.
    9. Guinet, Alain & Legrand, Marie, 1998. "Reduction of job-shop problems to flow-shop problems with precedence constraints," European Journal of Operational Research, Elsevier, vol. 109(1), pages 96-110, August.
    10. Rajendran, Chandrasekharan & Ziegler, Hans, 2001. "A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs," European Journal of Operational Research, Elsevier, vol. 131(3), pages 622-634, June.
    11. Ruiz, Rubén & Maroto, Concepciøn & Alcaraz, Javier, 2006. "Two new robust genetic algorithms for the flowshop scheduling problem," Omega, Elsevier, vol. 34(5), pages 461-476, October.
    12. W Q Huang & L Wang, 2006. "A local search method for permutation flow shop scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1248-1251, October.
    13. Ruiz, Ruben & Stutzle, Thomas, 2007. "A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2033-2049, March.
    14. M Haouari & T Ladhari, 2003. "A branch-and-bound-based local search method for the flow shop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1076-1084, October.
    15. Vacharapoom Benjaoran & Nashwan Dawood & Brian Hobbs, 2005. "Flowshop scheduling model for bespoke precast concrete production planning," Construction Management and Economics, Taylor & Francis Journals, vol. 23(1), pages 93-105.
    16. O Etiler & B Toklu & M Atak & J Wilson, 2004. "A genetic algorithm for flow shop scheduling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(8), pages 830-835, August.
    17. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 2006. "Some aspects of scatter search in the flow-shop problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 654-666, March.
    18. Kalczynski, Pawel J. & Kamburowski, Jerzy, 2009. "An empirical analysis of the optimality rate of flow shop heuristics," European Journal of Operational Research, Elsevier, vol. 198(1), pages 93-101, October.
    19. Koulamas, Christos, 1998. "A new constructive heuristic for the flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 105(1), pages 66-71, February.
    20. Abdeljaouad, Mohamed Amine & Bahroun, Zied & Omrane, Anissa & Fondrevelle, Julien, 2015. "Job-shop production scheduling with reverse flows," European Journal of Operational Research, Elsevier, vol. 244(1), pages 117-128.

    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:38:y:1995:i:2-3:p:133-145. 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.