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

The single‐machine absolute‐deviation early‐tardy problem with random completion times

Author

Listed:
  • Umar M. Al‐Turki
  • John Mittenthal
  • M. Raghavachari

Abstract

We consider sequencing n jobs on a single machine subject to job completion times arising from either machine breakdowns or other causes. The objective is to minimize an expected weighted combination of due dates, completion times, earliness, and tardiness penalties. The determination of optimal distinct due dates or optimal common due dates for a given schedule is investigated. The scheduling problem for a fixed common due date is considered when random completion times arise from machine breakdowns. The optimality of a V‐shaped about (a point) T sequence is established when the number of machine breakdowns follows either a Poisson or a geometric distribution and the duration of a breakdown has an exponential distribution. © 1996 John Wiley & Sons, Inc.

Suggested Citation

  • Umar M. Al‐Turki & John Mittenthal & M. Raghavachari, 1996. "The single‐machine absolute‐deviation early‐tardy problem with random completion times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(4), pages 573-587, June.
    • Handle: RePEc:wly:navres:v:43:y:1996:i:4:p:573-587
    DOI: 10.1002/(SICI)1520-6750(199606)43:43.0.CO;2-4
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199606)43:43.0.CO;2-4
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199606)43:43.0.CO;2-4?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. Uttarayan Bagchi & Robert S. Sullivan & Y. L. Chang, 1986. "Minimizing mean absolute deviation of completion times about a common due date," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 33(2), pages 227-240, May.
    2. J. Birge & J. B. G. Frenk & J. Mittenthal & A. H. G. Rinnooy Kan, 1990. "Single‐machine scheduling subject to stochastic breakdowns," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(5), pages 661-677, October.
    3. John J. Kanet, 1981. "Minimizing the average deviation of job completion times about a common due date," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 28(4), pages 643-651, December.
    4. Sarin, Subhash C. & Erel, Erdal & Steiner, George, 1991. "Sequencing jobs on a single machine with a common due date and stochastic processing times," European Journal of Operational Research, Elsevier, vol. 51(2), pages 188-198, March.
    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. John Mittenthal & M. Raghavachari, 1993. "Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties," Operations Research, INFORMS, vol. 41(4), pages 786-796, August.
    7. Cheng, T. C. E. & Gupta, M. C., 1989. "Survey of scheduling research involving due date determination decisions," European Journal of Operational Research, Elsevier, vol. 38(2), pages 156-166, January.
    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. Xiaoqiang Cai & Sean Zhou, 1999. "Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs," Operations Research, INFORMS, vol. 47(3), pages 422-437, June.
    2. 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.
    3. 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.
    4. Andreas C. Nearchou & Sotiris L. Omirou, 2024. "Self-Adaptive Biased Differential Evolution for Scheduling Against Common Due Dates," SN Operations Research Forum, Springer, vol. 5(2), pages 1-29, June.
    5. 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.
    6. T. C. E. Cheng & H. G. Kahlbacher, 1991. "A proof for the longest‐job‐first policy in one‐machine scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 715-720, October.
    7. Adamopoulos, G. I. & Pappis, C. P., 1995. "The CON due-date determination method with processing time-dependent lateness penalties," International Journal of Production Economics, Elsevier, vol. 40(1), pages 29-36, June.
    8. Yeong‐Dae Kim & Candace Arai Yano, 1994. "Minimizing mean tardiness and earliness in single‐machine scheduling problems with unequal due dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(7), pages 913-933, December.
    9. Soroush, H. M., 1999. "Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs," European Journal of Operational Research, Elsevier, vol. 113(2), pages 450-468, March.
    10. 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.
    11. 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.
    12. Ramesh Bollapragada & Norman M. Sadeh, 2004. "Proactive release procedures for just‐in‐time job shop environments, subject to machine failures," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(7), pages 1018-1044, October.
    13. Adamopoulos, G. I. & Pappis, C. P., 1996. "Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method," European Journal of Operational Research, Elsevier, vol. 88(2), pages 336-344, January.
    14. 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.
    15. Chung‐Lun Li & T. C. E. Cheng, 1994. "The parallel machine min‐max weighted absolute lateness scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(1), pages 33-46, February.
    16. Y. P. Aneja & S. N. Kabadi & A. Nagar, 1998. "Minimizing weighted mean absolute deviation of flow times in single machine systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(3), pages 297-311, April.
    17. 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.
    18. 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.
    19. Bernard Dickman & Yonah Wilamowsky & Sheldon Epstein, 2001. "Multiple common due dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(4), pages 293-298, June.
    20. Zhenpeng Li & Congdian Cheng, 2023. "The Expected Competitive Ratio on a Kind of Stochastic-Online Flowtime Scheduling with Machine Subject to an Uncertain Breakdown," Mathematics, MDPI, vol. 11(11), pages 1-12, 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:43:y:1996:i:4:p:573-587. 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.