IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v40y1993i2p229-243.html
   My bibliography  Save this article

Adjacent orderings in single‐machine scheduling with earliness and tardiness penalties

Author

Listed:
  • Wlodzimierz Szwarc

Abstract

This article deals with a single‐machine n job earliness‐tardiness model with job‐independent penalties. It demonstrates that the arrangement of adjacent jobs in an optimal schedule depends on a critical value of the start times. Based on these precedence relations, the article develops criteria under which the problem can be decomposed into smaller subproblems. The branching scheme that used the developed results was tested on 70 examples of size n = 10. This scheme should be incorporated in any branch‐and‐bound method once a lower bound is found. The branching scheme can easily handle small problems without a lower bound. © 1993 John Wiley & Sons, Inc.

Suggested Citation

  • Wlodzimierz Szwarc, 1993. "Adjacent orderings in single‐machine scheduling with earliness and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(2), pages 229-243, March.
    • Handle: RePEc:wly:navres:v:40:y:1993:i:2:p:229-243
    DOI: 10.1002/1520-6750(199303)40:23.0.CO;2-R
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199303)40:23.0.CO;2-R
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199303)40:23.0.CO;2-R?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
    ---><---

    References listed on IDEAS

    as
    1. Jianzhong Du & Joseph Y.-T. Leung, 1990. "Minimizing Total Tardiness on One Machine is NP-Hard," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 483-495, August.
    2. Wlodzimierz Szwarc & Marc E. Posner & John J. Liu, 1988. "The Single Machine Problem with a Quadratic Cost Function of Completion Times," Management Science, INFORMS, vol. 34(12), pages 1480-1488, December.
    3. Wlodzimierz Szwarc, 1989. "Single‐machine scheduling to minimize absolute deviation of completion times from a common due date," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(5), pages 663-673, October.
    4. Uttarayan Bagchi & Yih‐Long Chang & Robert S. Sullivan, 1987. "Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 739-751, October.
    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. 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.
    2. 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.
    3. Schaller, Jeffrey & Valente, Jorge M.S., 2020. "Minimizing total earliness and tardiness in a nowait flow shop," International Journal of Production Economics, Elsevier, vol. 224(C).

    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. 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.
    2. 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.
    3. Derya Deliktaş, 2022. "Self-adaptive memetic algorithms for multi-objective single machine learning-effect scheduling problems with release times," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 748-784, September.
    4. Ganesan, Viswanath Kumar & Sivakumar, Appa Iyer, 2006. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times," International Journal of Production Economics, Elsevier, vol. 103(2), pages 633-647, October.
    5. Quang Chieu Ta & Jean-Charles Billaut & Jean-Louis Bouquard, 2018. "Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 617-628, March.
    6. 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.
    7. A. G. Leeftink & R. J. Boucherie & E. W. Hans & M. A. M. Verdaasdonk & I. M. H. Vliegen & P. J. Diest, 2018. "Batch scheduling in the histopathology laboratory," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 171-197, June.
    8. Fernández, Elena & Munoz-Marquez, Manuel, 2022. "New formulations and solutions for the strategic berth template problem," European Journal of Operational Research, Elsevier, vol. 298(1), pages 99-117.
    9. Janiak, Adam & Krysiak, Tomasz & Pappis, Costas P. & Voutsinas, Theodore G., 2009. "A scheduling problem with job values given as a power function of their completion times," European Journal of Operational Research, Elsevier, vol. 193(3), pages 836-848, March.
    10. Adam Kasperski & Paweł Zieliński, 2019. "Risk-averse single machine scheduling: complexity and approximation," Journal of Scheduling, Springer, vol. 22(5), pages 567-580, October.
    11. 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.
    12. John J. Clifford & Marc E. Posner, 2000. "High Multiplicity in Earliness-Tardiness Scheduling," Operations Research, INFORMS, vol. 48(5), pages 788-800, October.
    13. Adamopoulos, George I. & Pappis, Costas P., 1998. "Scheduling under a common due-data on parallel unrelated machines," European Journal of Operational Research, Elsevier, vol. 105(3), pages 494-501, March.
    14. Christos Koulamas, 1997. "Decomposition and hybrid simulated annealing heuristics for the parallel‐machine total tardiness problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(1), pages 109-125, February.
    15. Awi Federgruen & Gur Mosheiov, 1993. "Simultaneous optimization of efficiency and performance balance measures in single‐machine scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(7), pages 951-970, December.
    16. Raúl Mencía & Carlos Mencía, 2021. "One-Machine Scheduling with Time-Dependent Capacity via Efficient Memetic Algorithms," Mathematics, MDPI, vol. 9(23), pages 1-24, November.
    17. Chengbin Chu, 1992. "A branch‐and‐bound algorithm to minimize total tardiness with different release dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 265-283, March.
    18. Yue, Jinfeng & Wang, Min-Chiang & Chen, Bintong, 2007. "Mean-range based distribution-free procedures to minimize "overage" and "underage" costs," European Journal of Operational Research, Elsevier, vol. 176(2), pages 1103-1116, January.
    19. J-B Wang & J-J Wang & P Ji, 2011. "Scheduling jobs with chain precedence constraints and deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1765-1770, September.
    20. Gerhard J. Woeginger, 1999. "An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 211-216, May.

    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:wly:navres:v:40:y:1993:i:2:p:229-243. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.