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

A heuristic for single machine scheduling with early and tardy costs

Author

Listed:
  • Mazzini, Renata
  • Armentano, Vinicius A.

Abstract

No abstract is available for this item.

Suggested Citation

  • Mazzini, Renata & Armentano, Vinicius A., 2001. "A heuristic for single machine scheduling with early and tardy costs," European Journal of Operational Research, Elsevier, vol. 128(1), pages 129-146, January.
  • Handle: RePEc:eee:ejores:v:128:y:2001:i:1:p:129-146
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00345-8
    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. Peng Si Ow & Thomas E. Morton, 1989. "The Single Machine Early/Tardy Problem," Management Science, INFORMS, vol. 35(2), pages 177-191, February.
    2. Michael R. Garey & Robert E. Tarjan & Gordon T. Wilfong, 1988. "One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties," Mathematics of Operations Research, INFORMS, vol. 13(2), pages 330-348, May.
    3. Kenneth R. Baker & Gary D. Scudder, 1990. "Sequencing with Earliness and Tardiness Penalties: A Review," Operations Research, INFORMS, vol. 38(1), pages 22-36, February.
    4. James, R. J. W. & Buchanan, J. T., 1997. "A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem," European Journal of Operational Research, Elsevier, vol. 102(3), pages 513-527, November.
    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. Mosheiov, Gur & Oron, Daniel, 2007. "Minmax scheduling with job-classes and earliness-tardiness costs," European Journal of Operational Research, Elsevier, vol. 177(1), pages 612-622, February.
    2. Y Li & A Lim & B Rodrigues, 2004. "Crossdocking—JIT scheduling with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1342-1351, December.
    3. G A Álvarez-Pérez & J L González-Velarde & J W Fowler, 2009. "Crossdocking— Just in Time scheduling: an alternative solution approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 554-564, April.
    4. Esteve, B. & Aubijoux, C. & Chartier, A. & T'kindt, V., 2006. "A recovering beam search algorithm for the single machine Just-in-Time scheduling problem," European Journal of Operational Research, Elsevier, vol. 172(3), pages 798-813, August.
    5. Wan, Guohua & Yen, Benjamin P.-C., 2009. "Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 195(1), pages 89-97, May.
    6. Vincent T’kindt & Karima Bouibede-Hocine & Carl Esswein, 2007. "Counting and enumeration complexity with application to multicriteria scheduling," Annals of Operations Research, Springer, vol. 153(1), pages 215-234, September.
    7. Simon Thevenin & Nicolas Zufferey & Marino Widmer, 2016. "Order acceptance and scheduling with earliness and tardiness penalties," Journal of Heuristics, Springer, vol. 22(6), pages 849-890, 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. Esteve, B. & Aubijoux, C. & Chartier, A. & T'kindt, V., 2006. "A recovering beam search algorithm for the single machine Just-in-Time scheduling problem," European Journal of Operational Research, Elsevier, vol. 172(3), pages 798-813, August.
    2. Baker, Kenneth R., 2014. "Minimizing earliness and tardiness costs in stochastic scheduling," European Journal of Operational Research, Elsevier, vol. 236(2), pages 445-452.
    3. Kate, H.A. ten & Wijngaard, J. & Zijm, W.H.M., 1995. "Minimizing weighted total earliness, total tardiness and setup costs," Research Report 95A37, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    4. 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.
    5. Koulamas, Christos, 1996. "Single-machine scheduling with time windows and earliness/tardiness penalties," European Journal of Operational Research, Elsevier, vol. 91(1), pages 190-202, May.
    6. Wan, Guohua & Yen, Benjamin P. -C., 2002. "Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties," European Journal of Operational Research, Elsevier, vol. 142(2), pages 271-281, October.
    7. repec:dgr:rugsom:95a37 is not listed on IDEAS
    8. Sridharan, V. & Zhou, Z., 1996. "A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 292-301, October.
    9. 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.
    10. Xia, Yu & Chen, Bintong & Yue, Jinfeng, 2008. "Job sequencing and due date assignment in a single machine shop with uncertain processing times," European Journal of Operational Research, Elsevier, vol. 184(1), pages 63-75, January.
    11. 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.
    12. James, R. J. W. & Buchanan, J. T., 1998. "Performance enhancements to tabu search for the early/tardy scheduling problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 254-265, April.
    13. Mosheiov, Gur & Shadmon, Michal, 2001. "Minmax earliness-tardiness costs with unit processing time jobs," European Journal of Operational Research, Elsevier, vol. 130(3), pages 638-652, May.
    14. Sourd, Francis, 2005. "Punctuality and idleness in just-in-time scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 739-751, December.
    15. Hendel, Yann & Sourd, Francis, 2006. "Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem," European Journal of Operational Research, Elsevier, vol. 173(1), pages 108-119, August.
    16. George Li, 1997. "Single machine earliness and tardiness scheduling," European Journal of Operational Research, Elsevier, vol. 96(3), pages 546-558, February.
    17. Simon Thevenin & Nicolas Zufferey & Marino Widmer, 2016. "Order acceptance and scheduling with earliness and tardiness penalties," Journal of Heuristics, Springer, vol. 22(6), pages 849-890, December.
    18. Zhi-Long Chen, 1997. "Scheduling with batch setup times and earliness-tardiness penalties," European Journal of Operational Research, Elsevier, vol. 96(3), pages 518-537, February.
    19. Jaw‐Yeh Chen & Sheng‐Fuu Lin, 2002. "Minimizing weighted earliness and tardiness penalties in single‐machine scheduling with idle time permitted," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(8), pages 760-780, December.
    20. Vincent T’kindt & Karima Bouibede-Hocine & Carl Esswein, 2007. "Counting and enumeration complexity with application to multicriteria scheduling," Annals of Operations Research, Springer, vol. 153(1), pages 215-234, September.
    21. James, R. J. W. & Buchanan, J. T., 1997. "A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem," European Journal of Operational Research, Elsevier, vol. 102(3), pages 513-527, November.

    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:128:y:2001:i:1:p:129-146. 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.