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

A note on unrelated parallel machine scheduling with time-dependent processing times

Author

Listed:
  • W-H Kuo

    (National Formosa University)

  • C-J Hsu

    (Nan-Kai Institute of Technology)

  • D-L Yang

    (National Formosa University)

Abstract

In the literature, most of the parallel machine scheduling problems, in which the processing time of a job is a linear function of its starting time, are proved to be NP-hard. In this paper, we study an unrelated parallel machine scheduling problem in which the processing time of a job is a linear function of its starting time. The objective is to minimize the total completion time of all jobs. We consider two linear functions of job starting time in the problem and show that it is polynomially solvable.

Suggested Citation

  • W-H Kuo & C-J Hsu & D-L Yang, 2009. "A note on unrelated parallel machine scheduling with time-dependent processing times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(3), pages 431-434, March.
    • Handle: RePEc:pal:jorsoc:v:60:y:2009:i:3:d:10.1057_palgrave.jors.2602576
    DOI: 10.1057/palgrave.jors.2602576
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602576
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602576?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. 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.
    2. B Alidaee & N K Womer, 1999. "Scheduling with time dependent processing times: Review and extensions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(7), pages 711-720, July.
    3. Biskup, Dirk, 1999. "Single-machine scheduling with learning considerations," European Journal of Operational Research, Elsevier, vol. 115(1), pages 173-178, May.
    4. G Mosheiov, 2001. "Parallel machine scheduling with a learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(10), pages 1165-1169, October.
    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. Chung-Lun Li, 2008. "A note on unrelated parallel machine scheduling with time-dependent processing times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1696-1697, December.
    2. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    3. S Gawiejnowicz & W-C Lee & C-L Lin & C-C Wu, 2011. "Single-machine scheduling of proportionally deteriorating jobs by two agents," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 1983-1991, November.

    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. Wang, Ji-Bo, 2007. "Single-machine scheduling problems with the effects of learning and deterioration," Omega, Elsevier, vol. 35(4), pages 397-402, August.
    2. Yang, Wen-Hua & Chand, Suresh, 2008. "Learning and forgetting effects on a group scheduling problem," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1033-1044, June.
    3. Wen-Hung Wu & Yunqiang Yin & T C E Cheng & Win-Chin Lin & Juei-Chao Chen & Shin-Yi Luo & Chin-Chia Wu, 2017. "A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 111-120, February.
    4. Cheng, T.C.E. & Shafransky, Y. & Ng, C.T., 2016. "An alternative approach for proving the NP-hardness of optimization problems," European Journal of Operational Research, Elsevier, vol. 248(1), pages 52-58.
    5. Yang, Suh-Jenq & Yang, Dar-Li, 2010. "Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities," Omega, Elsevier, vol. 38(6), pages 528-533, December.
    6. Wang, Xiuli & Edwin Cheng, T.C., 2007. "Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 178(1), pages 57-70, April.
    7. Chang, Pei-Chann & Chen, Shih-Hsin & Mani, V., 2009. "A note on due-date assignment and single machine scheduling with a learning/aging effect," International Journal of Production Economics, Elsevier, vol. 117(1), pages 142-149, January.
    8. Min Ji & Chou-Jung Hsu & Dar-Li Yang, 2013. "Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 437-447, October.
    9. Radosław Rudek, 2012. "Scheduling problems with position dependent job processing times: computational complexity results," Annals of Operations Research, Springer, vol. 196(1), pages 491-516, July.
    10. W-H Kuo & D-L Yang, 2008. "Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 416-420, March.
    11. Kai-biao Sun & Hong-xing Li, 2009. "Some single-machine scheduling problems with actual time and position dependent learning effects," Fuzzy Information and Engineering, Springer, vol. 1(2), pages 161-177, June.
    12. Qian, Jianbo & Steiner, George, 2013. "Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine," European Journal of Operational Research, Elsevier, vol. 225(3), pages 547-551.
    13. Cheng, T.C.E. & Wu, Chin-Chia & Chen, Juei-Chao & Wu, Wen-Hsiang & Cheng, Shuenn-Ren, 2013. "Two-machine flowshop scheduling with a truncated learning function to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 141(1), pages 79-86.
    14. Dar-Li Yang & Wen-Hung Kuo, 2009. "Single-machine scheduling with both deterioration and learning effects," Annals of Operations Research, Springer, vol. 172(1), pages 315-327, November.
    15. Rustogi, Kabir & Strusevich, Vitaly A., 2012. "Simple matching vs linear assignment in scheduling models with positional effects: A critical review," European Journal of Operational Research, Elsevier, vol. 222(3), pages 393-407.
    16. C-C He & C-C Wu & W-C Lee, 2009. "Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1759-1766, December.
    17. Wang, Ling & Sun, Lin-Yan & Sun, Lin-Hui & Wang, Ji-Bo, 2010. "On three-machine flow shop scheduling with deteriorating jobs," International Journal of Production Economics, Elsevier, vol. 125(1), pages 185-189, May.
    18. Wu, Chin-Chia & Lee, Wen-Chiung, 2006. "Two-machine flowshop scheduling to minimize mean flow time under linear deterioration," International Journal of Production Economics, Elsevier, vol. 103(2), pages 572-584, October.
    19. Lodree Jr., Emmett J. & Geiger, Christopher D., 2010. "A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration," European Journal of Operational Research, Elsevier, vol. 201(2), pages 644-648, March.
    20. Jun Pei & Bayi Cheng & Xinbao Liu & Panos M. Pardalos & Min Kong, 2019. "Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time," Annals of Operations Research, Springer, vol. 272(1), pages 217-241, January.

    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:60:y:2009:i:3:d:10.1057_palgrave.jors.2602576. 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.