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

Minimizing weighted mean absolute deviation of flow times in single machine systems

Author

Listed:
  • Y. P. Aneja
  • S. N. Kabadi
  • A. Nagar

Abstract

We discuss the problem of scheduling several jobs on a single machine with the objective of minimizing the weighted mean absolute deviation of flow times around the weighted mean flow time. We first show that the optimal schedule is W‐shaped. For the unweighted case, we show that all optimal schedules are V‐shaped. This characterization enables us to show that the problem is NP‐hard. We then provide a pseudopolynomial algorithm for the unweighted problem. Finally, we consider three heuristic algorithms for the unweighted problem and report computational experience with these algorithms. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 297–311, 1998

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:45:y:1998:i:3:p:297-311
    DOI: 10.1002/(SICI)1520-6750(199804)45:33.0.CO;2-2
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199804)45:33.0.CO;2-2
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199804)45:33.0.CO;2-2?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. 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.
    2. Vina Vani & M. Raghavachari, 1987. "Deterministic and Random Single Machine Sequencing with Variance Minimization," Operations Research, INFORMS, vol. 35(1), pages 111-120, February.
    3. Prabuddha De & Jay B. Ghosh & Charles E. Wells, 1992. "On the Minimization of Completion Time Variance with a Bicriteria Extension," Operations Research, INFORMS, vol. 40(6), pages 1148-1155, December.
    4. Gupta, Mahesh C. & Gupta, Yash P. & Kumar, Anup, 1993. "Minimizing flow time variance in a single machine system using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 70(3), pages 289-303, November.
    5. Samuel Eilon & I. G. Chowdhury, 1977. "Minimising Waiting Time Variance in the Single Machine Problem," Management Science, INFORMS, vol. 23(6), pages 567-575, February.
    6. John J. Kanet, 1981. "Minimizing Variation of Flow Time in Single Machine Systems," Management Science, INFORMS, vol. 27(12), pages 1453-1459, December.
    7. 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.
    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. Gur Mosheiov, 2000. "Minimizing mean absolute deviation of job completion times from the mean completion time," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(8), pages 657-668, 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. Cai, X., 1995. "Minimization of agreeably weighted variance in single machine systems," European Journal of Operational Research, Elsevier, vol. 85(3), pages 576-592, September.
    2. 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.
    3. Cai, X., 1996. "V-shape property for job sequences that minimize the expected completion time variance," European Journal of Operational Research, Elsevier, vol. 91(1), pages 118-123, May.
    4. Weng, Xiaohua & Ventura, Jose A., 1996. "Scheduling about a given common due date to minimize mean squared deviation of completion times," European Journal of Operational Research, Elsevier, vol. 88(2), pages 328-335, January.
    5. Srirangacharyulu, B. & Srinivasan, G., 2013. "An exact algorithm to minimize mean squared deviation of job completion times about a common due date," European Journal of Operational Research, Elsevier, vol. 231(3), pages 547-556.
    6. C.T. Ng & X. Cai & T.C.E. Cheng, 1999. "Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(4), pages 373-398, June.
    7. 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.
    8. J. Steve Davis & John J. Kanet, 1993. "Single‐machine scheduling with early and tardy completion costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(1), pages 85-101, February.
    9. 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.
    10. Seo, Jong Hwa & Kim, Chae-Bogk & Lee, Dong Hoon, 2001. "Minimizing mean squared deviation of completion times with maximum tardiness constraint," European Journal of Operational Research, Elsevier, vol. 129(1), pages 95-104, February.
    11. Wang, Ji-Bo & Xia, Zun-Quan, 2007. "Single machine scheduling problems with controllable processing times and total absolute differences penalties," European Journal of Operational Research, Elsevier, vol. 177(1), pages 638-645, February.
    12. 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.
    13. 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.
    14. 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.
    15. Gur Mosheiov, 2000. "Minimizing mean absolute deviation of job completion times from the mean completion time," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(8), pages 657-668, December.
    16. Koulamas, Christos & Kyparisis, George J., 2023. "Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection," European Journal of Operational Research, Elsevier, vol. 305(2), pages 608-616.
    17. 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.
    18. Gowrishankar, K. & Rajendran, Chandrasekharan & Srinivasan, G., 2001. "Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date," European Journal of Operational Research, Elsevier, vol. 132(3), pages 643-665, August.
    19. Manna, D. K. & Prasad, V. Rajendra, 1999. "Bounds for the position of the smallest job in completion time variance minimization," European Journal of Operational Research, Elsevier, vol. 114(2), pages 411-419, April.
    20. Kubiak, Wieslaw & Cheng, Jinliang & Kovalyov, Mikhail Y., 2002. "Fast fully polynomial approximation schemes for minimizing completion time variance," European Journal of Operational Research, Elsevier, vol. 137(2), pages 303-309, March.

    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:45:y:1998:i:3:p:297-311. 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.