IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v20y2012i3p754-767.html
   My bibliography  Save this article

Minimizing weighted earliness–tardiness on a single machine with a common due date using quadratic models

Author

Listed:
  • Ramon Alvarez-Valdes
  • Enric Crespo
  • Jose Tamarit
  • Fulgencia Villa

Abstract

In this paper we study the problem of minimizing weighted earliness and tardiness on a single machine when all the jobs share the same due date. We propose two quadratic integer programming models for solving both cases of unrestricted and restricted due dates, an auxiliary model based on unconstrained quadratic integer programming and an algorithmic scheme for solving each instance, according to its size and characteristics, in the most efficient way. The scheme is tested on a set of well-known test problems. By combining the solutions of the three models we prove the optimality of the solutions obtained for most of the problems. For large instances, although optimality cannot be proved, we actually obtain optimal solutions for all the tested instances. Copyright Sociedad de Estadística e Investigación Operativa 2012

Suggested Citation

  • 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.
  • Handle: RePEc:spr:topjnl:v:20:y:2012:i:3:p:754-767
    DOI: 10.1007/s11750-010-0163-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-010-0163-7
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s11750-010-0163-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Plateau, M.-C. & Rios-Solis, Y.A., 2010. "Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations," European Journal of Operational Research, Elsevier, vol. 201(3), pages 729-736, March.
    2. 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.
    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. Hino, Celso M. & Ronconi, Debora P. & Mendes, Andre B., 2005. "Minimizing earliness and tardiness penalties in a single-machine problem with a common due date," European Journal of Operational Research, Elsevier, vol. 160(1), pages 190-201, January.
    5. Nicholas G. Hall & Marc E. Posner, 1991. "Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 836-846, October.
    6. S. S. Panwalkar & M. L. Smith & A. Seidmann, 1982. "Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem," Operations Research, INFORMS, vol. 30(2), pages 391-399, April.
    7. 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.
    8. Nicholas G. Hall & Wieslaw Kubiak & Suresh P. Sethi, 1991. "Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 847-856, October.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    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. 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.
    8. Chen, Zhi-Long, 1996. "Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs," European Journal of Operational Research, Elsevier, vol. 93(1), pages 49-60, August.
    9. Dvir Shabtay & George Steiner, 2008. "The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times," Annals of Operations Research, Springer, vol. 159(1), pages 25-40, March.
    10. 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.
    11. 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.
    12. X. Cai & S. Zhou, 1997. "Scheduling stochastic jobs with asymmetric earliness and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(6), pages 531-557, September.
    13. 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.
    14. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    15. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    16. Shabtay, Dvir, 2016. "Optimal restricted due date assignment in scheduling," European Journal of Operational Research, Elsevier, vol. 252(1), pages 79-89.
    17. 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.
    18. Alidaee, Bahram & Dragan, Irinel, 1997. "A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date," European Journal of Operational Research, Elsevier, vol. 96(3), pages 559-563, February.
    19. Baker, Kenneth R., 2014. "Minimizing earliness and tardiness costs in stochastic scheduling," European Journal of Operational Research, Elsevier, vol. 236(2), pages 445-452.
    20. X. Cai & F. S. Tu, 1996. "Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early‐tardy penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1127-1146, December.

    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:spr:topjnl:v:20:y:2012:i:3:p:754-767. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.