IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v59y2008i10d10.1057_palgrave.jors.2602480.html
   My bibliography  Save this article

Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines

Author

Listed:
  • G Mosheiov

    (The Hebrew University)

Abstract

As a measure of variation, total absolute deviation of job completion times (TADC) has received relatively little attention in scheduling literature. Minimizing TADC on a single machine was shown to have a polynomial time solution. In this note, we extend TADC in two directions: (i) we allow position-dependent processing times and (ii) we consider parallel identical machines. We show that each of these two more general problems, and TADC with both extensions remain polynomially solvable.

Suggested Citation

  • G Mosheiov, 2008. "Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(10), pages 1422-1424, October.
    • Handle: RePEc:pal:jorsoc:v:59:y:2008:i:10:d:10.1057_palgrave.jors.2602480
    DOI: 10.1057/palgrave.jors.2602480
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602480
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602480?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
    ---><---

    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. Nicholas G. Hall & Wieslaw Kubiak & Suresh P. Sethi, 1991. "Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 847-856, October.
    2. Cheng, T. C. E. & Ding, Q. & Lin, B. M. T., 2004. "A concise survey of scheduling with time-dependent processing times," European Journal of Operational Research, Elsevier, vol. 152(1), pages 1-13, January.
    3. John J. Kanet, 1981. "Minimizing Variation of Flow Time in Single Machine Systems," Management Science, INFORMS, vol. 27(12), pages 1453-1459, December.
    4. Linus Schrage, 1975. "Minimizing the Time-in-System Variance for a Finite Jobset," Management Science, INFORMS, vol. 21(5), pages 540-543, January.
    5. Alan G. Merten & Mervin E. Muller, 1972. "Variance Minimization in Single Machine Sequencing Problems," Management Science, INFORMS, vol. 18(9), pages 518-528, May.
    6. 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.
    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. Bartłomiej Przybylski, 2022. "Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 207-222, August.
    2. Ji-Bo Wang & Ming-Zheng Wang, 2011. "Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 191(1), pages 155-169, November.
    3. Li, Gang & Wang, Xiao-Yuan & Wang, Ji-Bo & Sun, Lin-Yan, 2013. "Worst case analysis of flow shop scheduling problems with a time-dependent learning effect," International Journal of Production Economics, Elsevier, vol. 142(1), pages 98-104.
    4. Zhang, Jun & Liu, Feng & Tang, Jiafu & Li, Yanhui, 2019. "The online integrated order picking and delivery considering Pickers’ learning effects for an O2O community supermarket," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 180-199.
    5. Baruch Mor & Gur Mosheiov, 2018. "A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection," Annals of Operations Research, Springer, vol. 271(2), pages 1079-1085, 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. 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.
    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. 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.
    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. 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.
    7. 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.
    8. 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.
    9. 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.
    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. 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.
    13. 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.
    14. 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.
    15. 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).
    16. 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.
    17. 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.
    18. 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.
    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. 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.

    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:pal:jorsoc:v:59:y:2008:i:10:d:10.1057_palgrave.jors.2602480. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.