IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v55y1998i2p169-175.html
   My bibliography  Save this article

A heuristic to minimize a quadratic function of job lateness on a single machine

Author

Listed:
  • Su, Ling-Huey
  • Chang, Pei-Chann

Abstract

No abstract is available for this item.

Suggested Citation

  • Su, Ling-Huey & Chang, Pei-Chann, 1998. "A heuristic to minimize a quadratic function of job lateness on a single machine," International Journal of Production Economics, Elsevier, vol. 55(2), pages 169-175, July.
    • Handle: RePEc:eee:proeco:v:55:y:1998:i:2:p:169-175
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(98)00041-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. Hoogeveen, J. A. & van de Velde, S. L., 1991. "Scheduling around a small common due date," European Journal of Operational Research, Elsevier, vol. 55(2), pages 237-242, November.
    2. 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.
    3. 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. J M S Valente, 2010. "Beam search heuristics for quadratic earliness and tardiness scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 620-631, April.
    2. Jorge M. S. Valente & Maria R. A. Moreira, 2008. "Greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties," FEP Working Papers 286, Universidade do Porto, Faculdade de Economia do Porto.
    3. Jorge M. S. Valente & Maria R. A. Moreira & Alok Singh & Rui A. F. S. Alves, 2009. "Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs," FEP Working Papers 312, Universidade do Porto, Faculdade de Economia do Porto.
    4. Jorge M. S. Valente & José Fernando Gonçalves, 2008. "A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties," FEP Working Papers 264, Universidade do Porto, Faculdade de Economia do Porto.
    5. Jorge M. S. Valente, 2007. "Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs," FEP Working Papers 250, Universidade do Porto, Faculdade de Economia do Porto.

    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. Della Croce, Federico, 1995. "Generalized pairwise interchanges and machine scheduling," European Journal of Operational Research, Elsevier, vol. 83(2), pages 310-319, June.
    2. Ventura, Jose A. & Radhakrishnan, Sanjay, 2003. "Single machine scheduling with symmetric earliness and tardiness penalties," European Journal of Operational Research, Elsevier, vol. 144(3), pages 598-612, February.
    3. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    4. Cai, X. & Lum, V. Y. S. & Chan, J. M. T., 1997. "Scheduling about a common due date with kob-dependent asymmetric earliness and tardiness penalties," European Journal of Operational Research, Elsevier, vol. 98(1), pages 154-168, April.
    5. Schaller, Jeffrey, 2002. "Minimizing the sum of squares lateness on a single machine," European Journal of Operational Research, Elsevier, vol. 143(1), pages 64-79, November.
    6. Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen, 2019. "Single-machine common due date total earliness/tardiness scheduling with machine unavailability," Journal of Scheduling, Springer, vol. 22(5), pages 543-565, October.
    7. Ramon Alvarez-Valdes & Enric Crespo & Jose Tamarit & Fulgencia Villa, 2012. "Minimizing weighted earliness–tardiness on a single machine with a common due date using quadratic models," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(3), pages 754-767, October.
    8. Sourd, Francis, 2005. "Punctuality and idleness in just-in-time scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 739-751, December.
    9. Falq, Anne-Elisabeth & Fouilhoux, Pierre & Kedad-Sidhoum, Safia, 2022. "Dominance inequalities for scheduling around an unrestrictive common due date," European Journal of Operational Research, Elsevier, vol. 296(2), pages 453-464.
    10. Lin, Shih-Wei & Chou, Shuo-Yan & Ying, Kuo-Ching, 2007. "A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date," European Journal of Operational Research, Elsevier, vol. 177(2), pages 1294-1301, March.
    11. Michael X. Weng & Jose A. Ventura, 1994. "Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(6), pages 843-851, October.
    12. Weng, Michael X. & Ventura, Jose A., 1996. "Single-machine earliness-tardiness scheduling about a common due date with tolerances," International Journal of Production Economics, Elsevier, vol. 42(3), pages 217-227, April.
    13. Enrique Gerstl & Gur Mosheiov, 2014. "Single machine just‐in‐time scheduling problems with two competing agents," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(1), pages 1-16, February.
    14. Hans Kellerer & Vitaly A. Strusevich, 2016. "Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications," Annals of Operations Research, Springer, vol. 240(1), pages 39-94, May.
    15. Helmut A. Sedding, 2020. "Scheduling jobs with a V-shaped time-dependent processing time," Journal of Scheduling, Springer, vol. 23(6), pages 751-768, December.
    16. Narges Hosseini & Kevin Taaffe, 2015. "Allocating operating room block time using historical caseload variability," Health Care Management Science, Springer, vol. 18(4), pages 419-430, December.
    17. Gur Mosheiov & Daniel Oron, 2004. "Due‐window assignment with unit processing‐time jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(7), pages 1005-1017, October.
    18. Biskup, Dirk & Feldmann, Martin, 2005. "On scheduling around large restrictive common due windows," European Journal of Operational Research, Elsevier, vol. 162(3), pages 740-761, May.
    19. 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.
    20. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, 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:proeco:v:55:y:1998:i:2:p:169-175. 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.