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

Generalized pairwise interchanges and machine scheduling

Author

Listed:
  • Della Croce, Federico

Abstract

No abstract is available for this item.

Suggested Citation

  • Della Croce, Federico, 1995. "Generalized pairwise interchanges and machine scheduling," European Journal of Operational Research, Elsevier, vol. 83(2), pages 310-319, June.
  • Handle: RePEc:eee:ejores:v:83:y:1995:i:2:p:310-319
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(95)00009-F
    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. Tadei, Roberto, 1993. "A note on "minimizing a quadratic function of job lateness on a single machine"," International Journal of Production Economics, Elsevier, vol. 32(2), pages 185-187, September.
    2. Sen, Tapan & Dileepan, Parthasarati & Ruparel, Bharat, 1990. "Minimizing a generalized quadratic penalty function of job completion times: An improved branch-and-bound approach," Engineering Costs and Production Economics, Elsevier, vol. 18(3), pages 197-202, January.
    3. Dileepan, Parthasarati & Sen, Tapan, 1991. "Bicriterion jobshop scheduling with total flowtime and sum of squared lateness," Engineering Costs and Production Economics, Elsevier, vol. 21(3), pages 295-299, July.
    4. Gupta, Sushil K. & Sen, Tapan, 1983. "Minimizing a quadratic function of job lateness on a single machine," Engineering Costs and Production Economics, Elsevier, vol. 7(3), pages 187-194, 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. Kolahan, F. & Liang, M., 1998. "An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 109(1), pages 142-159, August.
    2. Haral, Uday & Chen, Rew-Win & Ferrell, William Jr & Kurz, Mary Beth, 2007. "Multiobjective single machine scheduling with nontraditional requirements," International Journal of Production Economics, Elsevier, vol. 106(2), pages 574-584, April.
    3. Della Croce, F. & Ghirardi, M. & Tadei, R., 2002. "An improved branch-and-bound algorithm for the two machine total completion time flow shop problem," European Journal of Operational Research, Elsevier, vol. 139(2), pages 293-301, June.

    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:83:y:1995:i:2:p:310-319. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/eor .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.