IDEAS home Printed from https://ideas.repec.org/p/ies/wpaper/e200816.html
   My bibliography  Save this paper

A Lower Bound for the Weighted Completion Time Variance Problem

Author

Listed:
  • Rabia Nessah

    (IÉSEG School of Management, (LEM-CNRS))

  • Chengbin Chu

    (Laboratoire Génie Industriel, École Centrale Paris)

Abstract

We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard in the strong sense. We propose a lower bound based on splitting of jobs and the Viswanathkumar and Srinivasan procedure and a heuristic. The test on more than 2000 instances shows that this lower bound is very tight.

Suggested Citation

  • Rabia Nessah & Chengbin Chu, 2008. "A Lower Bound for the Weighted Completion Time Variance Problem," Working Papers 2008-ECO-16, IESEG School of Management, revised May 2010.
    • Handle: RePEc:ies:wpaper:e200816
    as

    Download full text from publisher

    File URL: http://my.ieseg.fr/bienvenue/DownloadDoc.asp?Fich=904328991_2008-ECO-16_Nessah_Chu.pdf
    File Function: First version, 2008
    Download Restriction: no
    File URL: http://my.ieseg.fr/bienvenue/DownloadDoc.asp?Fich=904328991_2008-ECO-16_Nessah_Chu.pdf
    File Function: Revised version, 2010-05
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    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. 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. T. Badics & E. Boros, 1998. "Minimization of Half-Products," Mathematics of Operations Research, INFORMS, vol. 23(3), pages 649-660, August.
    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. 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.
    3. 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.
    4. Nasini, Stefano & Nessah, Rabia, 2022. "A multi-machine scheduling solution for homogeneous processing: Asymptotic approximation and applications," International Journal of Production Economics, Elsevier, vol. 251(C).
    5. Nasini, Stefano & Nessah, Rabia, 2021. "An almost exact solution to the min completion time variance in a single machine," European Journal of Operational Research, Elsevier, vol. 294(2), pages 427-441.

    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. 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.
    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. 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.
    4. 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.
    5. 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.
    6. Cheng, Jinliang & Kubiak, Wieslaw, 2005. "A half-product based approximation scheme for agreeably weighted completion time variance," European Journal of Operational Research, Elsevier, vol. 162(1), pages 45-54, April.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Klaus Heeger & Danny Hermelin & George B. Mertzios & Hendrik Molter & Rolf Niedermeier & Dvir Shabtay, 2023. "Equitable scheduling on a single machine," Journal of Scheduling, Springer, vol. 26(2), pages 209-225, April.
    13. Mittenthal, John & Raghavachari, M. & Rana, Arif I., 1995. "V- and GG-shaped properties for optimal single machine schedules for a class of non-separable penalty functions," European Journal of Operational Research, Elsevier, vol. 86(2), pages 262-269, October.
    14. Shi-Sheng Li & Ren-Xia Chen & Qi Feng & Cheng-Wen Jiao, 2019. "Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 957-971, October.
    15. Richard Baron & Jacques Durieu & Hans Haller & Rahul Savani & Philippe Solal, 2008. "Good neighbors are hard to find: computational complexity of network formation," Review of Economic Design, Springer;Society for Economic Design, vol. 12(1), pages 1-19, April.
    16. 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.
    17. Halman, Nir & Kellerer, Hans & Strusevich, Vitaly A., 2018. "Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints," European Journal of Operational Research, Elsevier, vol. 270(2), pages 435-447.
    18. Mikhail Y. Kovalyov & Marie-Claude Portmann & Ammar Oulamara, 2006. "Optimal testing and repairing a failed series system," Journal of Combinatorial Optimization, Springer, vol. 12(3), pages 279-295, November.
    19. Gerhard J. Woeginger, 2000. "When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 57-74, February.
    20. 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.

    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:ies:wpaper:e200816. 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: Lies BOUTEN (email available below). General contact details of provider: https://edirc.repec.org/data/iesegfr.html .

    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.