IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v62y2011i9d10.1057_jors.2010.120.html
   My bibliography  Save this article

Scheduling jobs with chain precedence constraints and deteriorating jobs

Author

Listed:
  • J-B Wang

    (Shenyang Aerospace University)

  • J-J Wang

    (Dalian University of Technology)

  • P Ji

    (The Hong Kong Polytechnic University)

Abstract

In this paper we consider a single machine scheduling problem with deteriorating jobs. By deteriorating jobs, we mean that the processing time of a job is a simple linear function of its execution starting time. For the jobs with chain precedence constraints, we prove that the weighted sum of squared completion times minimization problem with strong chains and weak chains can be solved in polynomial time, respectively.

Suggested Citation

  • J-B Wang & J-J Wang & P Ji, 2011. "Scheduling jobs with chain precedence constraints and deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1765-1770, September.
  • Handle: RePEc:pal:jorsoc:v:62:y:2011:i:9:d:10.1057_jors.2010.120
    DOI: 10.1057/jors.2010.120
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2010.120
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/jors.2010.120?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. Mondal, Sakib A. & Sen, Anup K., 2000. "An improved precedence rule for single machine sequencing problems with quadratic penalty," European Journal of Operational Research, Elsevier, vol. 125(2), pages 425-428, September.
    2. Wang, Ji-Bo & Xia, Zun-Quan, 2006. "Flow shop scheduling with deteriorating jobs under dominating machines," Omega, Elsevier, vol. 34(4), pages 327-336, August.
    3. Wlodzimierz Szwarc & Marc E. Posner & John J. Liu, 1988. "The Single Machine Problem with a Quadratic Cost Function of Completion Times," Management Science, INFORMS, vol. 34(12), pages 1480-1488, December.
    4. Gur Mosheiov, 1991. "V-Shaped Policies for Scheduling Deteriorating Jobs," Operations Research, INFORMS, vol. 39(6), pages 979-991, December.
    5. A A K Jeng & B M T Lin, 2007. "A note on parallel-machine scheduling with deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(6), pages 824-826, June.
    6. Kang, Liying & Ng, C.T., 2007. "A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs," International Journal of Production Economics, Elsevier, vol. 109(1-2), pages 180-184, September.
    7. 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.
    8. A Kononov & S Gawiejnowicz, 2001. "NP-hard cases in scheduling deteriorating jobs on dedicated machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(6), pages 708-717, June.
    9. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "Complexity results for scheduling chains on a single machine," European Journal of Operational Research, Elsevier, vol. 4(4), pages 270-275, April.
    10. J-B Wang & Z-Q Xia, 2006. "Flow shop scheduling problems with deteriorating jobs under dominating machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(2), pages 220-226, February.
    11. Sid Browne & Uri Yechiali, 1990. "Scheduling Deteriorating Jobs on a Single Processor," Operations Research, INFORMS, vol. 38(3), pages 495-498, June.
    12. Peter Brucker & Sigrid Knust & Ceyda Oğuz, 2006. "Scheduling chains with identical jobs and constant delays on a single machine," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(1), pages 63-75, February.
    13. W. Townsend, 1978. "The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution," Management Science, INFORMS, vol. 24(5), pages 530-534, January.
    14. Alix Munier & Francis Sourd, 2003. "Scheduling chains on a single machine with non-negative time lags," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 57(1), pages 111-123, April.
    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. Sun, Lin-Hui & Sun, Lin-Yan & Wang, Ming-Zheng & Wang, Ji-Bo, 2012. "Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines," International Journal of Production Economics, Elsevier, vol. 138(1), pages 195-200.
    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. Joonyup Eun & Chang Sup Sung & Eun-Seok Kim, 2017. "Maximizing total job value on a single machine with job selection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 998-1005, September.

    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. Li, Yongqiang & Li, Gang & Sun, Linyan & Xu, Zhiyong, 2009. "Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times," International Journal of Production Economics, Elsevier, vol. 118(2), pages 424-429, April.
    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. Cheng, Yushao & Sun, Shijie, 2009. "Scheduling linear deteriorating jobs with rejection on a single machine," European Journal of Operational Research, Elsevier, vol. 194(1), pages 18-27, April.
    4. Ming Liu & Feifeng Zheng & Chengbin Chu & Jiantong Zhang, 2012. "An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration," Journal of Combinatorial Optimization, Springer, vol. 23(4), pages 483-492, May.
    5. 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.
    6. 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.
    7. Wang, Ji-Bo, 2007. "Single-machine scheduling problems with the effects of learning and deterioration," Omega, Elsevier, vol. 35(4), pages 397-402, August.
    8. Sawik, Tadeusz, 2010. "An integer programming approach to scheduling in a contaminated area," Omega, Elsevier, vol. 38(3-4), pages 179-191, June.
    9. Ma, Ran & Tao, Jiping & Yuan, Jinjiang, 2016. "Online scheduling with linear deteriorating jobs to minimize the total weighted completion time," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 570-583.
    10. 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.
    11. Sun, Lin-Hui & Sun, Lin-Yan & Wang, Ming-Zheng & Wang, Ji-Bo, 2012. "Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines," International Journal of Production Economics, Elsevier, vol. 138(1), pages 195-200.
    12. Wu, Chin-Chia & Lee, Wen-Chiung, 2008. "Single-machine group-scheduling problems with deteriorating setup times and job-processing times," International Journal of Production Economics, Elsevier, vol. 115(1), pages 128-133, September.
    13. 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.
    14. T C E Cheng & L Kang & C T Ng, 2004. "Due-date assignment and single machine scheduling with deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 198-203, February.
    15. Wen-Chiung Lee, 2004. "A Note on Deteriorating Jobs and Learning in Single-Machine Scheduling Problems," International Journal of Business and Economics, School of Management Development, Feng Chia University, Taichung, Taiwan, vol. 3(1), pages 83-89, April.
    16. 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.
    17. 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.
    18. Delorme, Maxence & Iori, Manuel & Mendes, Nilson F.M., 2021. "Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events," European Journal of Operational Research, Elsevier, vol. 295(3), pages 823-837.
    19. Baruch Mor & Gur Mosheiov, 2021. "A note: flowshop scheduling with linear deterioration and job-rejection," 4OR, Springer, vol. 19(1), pages 103-111, March.
    20. J-B Wang & Z-Q Xia, 2006. "Flow shop scheduling problems with deteriorating jobs under dominating machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(2), pages 220-226, February.

    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:62:y:2011:i:9:d:10.1057_jors.2010.120. 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.