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

Algorithm for minimizing weighted earliness penalty in single-machine problem

Author

Listed:
  • Pathumnakul, Supachai
  • Egbelu, Pius J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Pathumnakul, Supachai & Egbelu, Pius J., 2005. "Algorithm for minimizing weighted earliness penalty in single-machine problem," European Journal of Operational Research, Elsevier, vol. 161(3), pages 780-796, March.
    • Handle: RePEc:eee:ejores:v:161:y:2005:i:3:p:780-796
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00635-0
    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. Qi, Xiangton & Tu, Feng-Sheng, 1998. "Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method," European Journal of Operational Research, Elsevier, vol. 105(3), pages 502-508, March.
    2. Peng Si Ow & Thomas E. Morton, 1989. "The Single Machine Early/Tardy Problem," Management Science, INFORMS, vol. 35(2), pages 177-191, February.
    3. Chhajed, Dilip, 1995. "A fixed interval due-date scheduling problem with earliness and due-date costs," European Journal of Operational Research, Elsevier, vol. 84(2), pages 385-401, July.
    4. Asano, Makoto & Ohta, Hiroshi, 1996. "Single machine scheduling using dominance relation to minimize earliness subject to ready and due times," International Journal of Production Economics, Elsevier, vol. 44(1-2), pages 35-43, June.
    5. 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.
    6. Chand, Suresh & Schneeberger, Hans, 1988. "Single machine scheduling to minimize weighted earliness subject to no tardy jobs," European Journal of Operational Research, Elsevier, vol. 34(2), pages 221-230, March.
    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. Feng Li & Zhi-Long Chen & Zhi-Long Chen, 2017. "Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 232-250, May.
    2. 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.
    3. Soroush, H.M., 2007. "Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 181(1), pages 266-287, August.
    4. Li, Kunpeng & Sivakumar, Appa Iyer & Ganesan, Viswanath Kumar, 2008. "Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain," European Journal of Operational Research, Elsevier, vol. 187(2), pages 442-455, June.

    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. Qi, Xiangton & Tu, Feng-Sheng, 1998. "Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method," European Journal of Operational Research, Elsevier, vol. 105(3), pages 502-508, March.
    2. 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.
    3. Feng Li & Zhi-Long Chen & Zhi-Long Chen, 2017. "Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 232-250, May.
    4. 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.
    5. 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.
    6. Chen, Wei-Yang & Sheen, Gwo-Ji, 2007. "Single-machine scheduling with multiple performance measures: Minimizing job-dependent earliness and tardiness subject to the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 109(1-2), pages 214-229, September.
    7. Valente, Jorge M.S. & Alves, Rui A.F.S., 2007. "Heuristics for the early/tardy scheduling problem with release dates," International Journal of Production Economics, Elsevier, vol. 106(1), pages 261-274, March.
    8. David J. Robb & Thomas R. Rohleder, 1996. "An evaluation of scheduling heuristics for dynamic single‐processor scheduling with early/tardy costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 349-364, April.
    9. repec:dgr:rugsom:95a37 is not listed on IDEAS
    10. 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.
    11. Baker, Kenneth R., 2014. "Minimizing earliness and tardiness costs in stochastic scheduling," European Journal of Operational Research, Elsevier, vol. 236(2), pages 445-452.
    12. 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).
    13. 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.
    14. Bachtenkirch, David & Bock, Stefan, 2022. "Finding efficient make-to-order production and batch delivery schedules," European Journal of Operational Research, Elsevier, vol. 297(1), pages 133-152.
    15. 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.
    16. George Li, 1997. "Single machine earliness and tardiness scheduling," European Journal of Operational Research, Elsevier, vol. 96(3), pages 546-558, February.
    17. 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.
    18. Asano, Makoto & Ohta, Hiroshi, 1999. "Single machine scheduling to meet due times under shutdown constraints," International Journal of Production Economics, Elsevier, vol. 60(1), pages 537-547, April.
    19. Wang, Julong & Liu, Zhixue & Li, Feng, 2024. "Integrated production and transportation scheduling problem under nonlinear cost structures," European Journal of Operational Research, Elsevier, vol. 313(3), pages 883-904.
    20. Alidaee, Bahram & Li, Haitao & Wang, Haibo & Womer, Keith, 2021. "Integer programming formulations in sequencing with total earliness and tardiness penalties, arbitrary due dates, and no idle time: A concise review and extension," Omega, Elsevier, vol. 103(C).
    21. 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.

    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:161:y:2005:i:3:p:780-796. 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.