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

Scheduling about a given common due date to minimize mean squared deviation of completion times

Author

Listed:
  • Weng, Xiaohua
  • Ventura, Jose A.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:88:y:1996:i:2:p:328-335
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00195-2
    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. Prabuddha De & Jay B. Ghosh & Charles E. Wells, 1989. "Note---A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date," Management Science, INFORMS, vol. 35(9), pages 1143-1147, September.
    2. 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.
    3. Uttarayan Bagchi & Robert S. Sullivan & Yih-Long Chang, 1987. "Minimizing Mean Squared Deviation of Completion Times About a Common Due Date," Management Science, INFORMS, vol. 33(7), pages 894-906, July.
    4. Alan G. Merten & Mervin E. Muller, 1972. "Variance Minimization in Single Machine Sequencing Problems," Management Science, INFORMS, vol. 18(9), pages 518-528, May.
    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. Vina Vani & M. Raghavachari, 1987. "Deterministic and Random Single Machine Sequencing with Variance Minimization," Operations Research, INFORMS, vol. 35(1), pages 111-120, February.
    7. 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.
    8. John J. Kanet, 1981. "Minimizing Variation of Flow Time in Single Machine Systems," Management Science, INFORMS, vol. 27(12), pages 1453-1459, December.
    9. Linus Schrage, 1975. "Minimizing the Time-in-System Variance for a Finite Jobset," Management Science, INFORMS, vol. 21(5), pages 540-543, January.
    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. Pereira, Jordi & Vásquez, Óscar C., 2017. "The single machine weighted mean squared deviation problem," European Journal of Operational Research, Elsevier, vol. 261(2), pages 515-529.
    2. 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.

    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. 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.
    2. 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.
    3. 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.
    4. Ng, C. T. & Cai, X. & Cheng, T. C. E., 1996. "A tight lower bound for the completion time variance problem," European Journal of Operational Research, Elsevier, vol. 92(1), pages 211-213, July.
    5. 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.
    6. 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.
    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. 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.
    9. 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.
    10. Nessah, Rabia & Chu, Chengbin, 2010. "A lower bound for weighted completion time variance," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1221-1226, December.
    11. Hans Kellerer & Vitaly A. Strusevich, 2016. "Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications," Annals of Operations Research, Springer, vol. 240(1), pages 39-94, May.
    12. 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.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. Gajpal, Yuvraj & Rajendran, Chandrasekharan, 2006. "An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops," International Journal of Production Economics, Elsevier, vol. 101(2), pages 259-272, June.
    18. Nasini, Stefano & Nessah, Rabia, 2024. "Time-flexible min completion time variance in a single machine by quadratic programming," European Journal of Operational Research, Elsevier, vol. 312(2), pages 427-444.
    19. 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.
    20. 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.

    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:88:y:1996:i:2:p:328-335. 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.