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

Minimizing flow time variance in a single machine system using genetic algorithms

Author

Listed:
  • Gupta, Mahesh C.
  • Gupta, Yash P.
  • Kumar, Anup

Abstract

No abstract is available for this item.

Suggested Citation

  • Gupta, Mahesh C. & Gupta, Yash P. & Kumar, Anup, 1993. "Minimizing flow time variance in a single machine system using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 70(3), pages 289-303, November.
    • Handle: RePEc:eee:ejores:v:70:y:1993:i:3:p:289-303
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(93)90240-N
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    2. Koksalan, Murat & Burak Keha, Ahmet, 2003. "Using genetic algorithms for single-machine bicriteria scheduling problems," European Journal of Operational Research, Elsevier, vol. 145(3), pages 543-556, March.
    3. Cai, X., 1995. "Minimization of agreeably weighted variance in single machine systems," European Journal of Operational Research, Elsevier, vol. 85(3), pages 576-592, September.
    4. Y. P. Aneja & S. N. Kabadi & A. Nagar, 1998. "Minimizing weighted mean absolute deviation of flow times in single machine systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(3), pages 297-311, April.
    5. Alan Levitan & Mahesh Gupta, 1996. "Using Genetic Algorithms to Optimize the Selection of Cost Drivers in Activity‐based Costing," Intelligent Systems in Accounting, Finance and Management, John Wiley & Sons, Ltd., vol. 5(3), pages 129-145, September.
    6. Gowrishankar, K. & Rajendran, Chandrasekharan & Srinivasan, G., 2001. "Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date," European Journal of Operational Research, Elsevier, vol. 132(3), pages 643-665, August.
    7. Kumar, Akhilesh & Prakash & Tiwari, M.K. & Shankar, Ravi & Baveja, Alok, 2006. "Solving machine-loading problem of a flexible manufacturing system with constraint-based genetic algorithm," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1043-1069, December.

    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:70:y:1993:i:3:p:289-303. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.