Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Scheduling jobs with general truncated learning effects including proportional setup times

  • Published:
Computational and Applied Mathematics Aims and scope Submit manuscript

Abstract

Scheduling problems with general truncated learning effects and past-sequence-dependent setup times on a single-machine are studied in this paper. The setup times of jobs are proportional to the length of the already processed jobs (i.e., past-sequence-dependent setup times). It shows that the addressed problems remains polynomially solvable for the following objectives: the makespan, the sum of the \(\varphi \)th power of job completion times, the total weighted completion time (with agreeable weights) and the maximum lateness (with agreeable due dates). For the general total weighted completion time (the maximum lateness) minimization, some solution algorithms (including heuristic, branch-and-bound and simulated annealing algorithms) are proposed to solve the problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Azzouz A, Ennigrou M, Said LB (2018) Scheduling problems under learning effects: classification and cartography. Int J Prod Res 56(4):1642–1661

    Article  Google Scholar 

  • Ben-Arieh D, Maimon O (1992) Annealing method for PCB assembly scheduling on two sequential machines. Int J Comput Integr Manuf 5(6):361–367

    Article  Google Scholar 

  • Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115(1):173–178

    Article  MATH  Google Scholar 

  • Biskup D, Herrmann J (2008) Single-machine scheduling against due dates with past-sequence-dependent setup times. Eur J Oper Res 191(2):587–592

    Article  MathSciNet  MATH  Google Scholar 

  • Cheng TCE, Lee W-C, Wu C-C (2010) Scheduling problems with deteriorating jobs and learning effects including proportional setup times. Comput Ind Eng 58(2):326–331

    Article  Google Scholar 

  • Cheng TCE, Lee W-C, Wu C-C (2011) Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times. Appl Math Modell 35(4):1861–1867

    Article  MathSciNet  MATH  Google Scholar 

  • Cheng TCE, Kuo W-H, Yang D-L (2014) Scheduling with a position-weighted learning effect. Optim Lett 8(1):293–306

    Article  MathSciNet  MATH  Google Scholar 

  • Hsu C-J, Kuo W-H, Yang D-L (2011) Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects. Appl Math Modell 35(3):1492–1496

    Article  MathSciNet  MATH  Google Scholar 

  • Huang X (2019) Bicriterion scheduling with group technology and deterioration effect. J Appl Math Comput 60(1–2):455–464

    Article  MathSciNet  MATH  Google Scholar 

  • Huang X, Li G, Huo Y, Ji P (2013) Single machine scheduling with general time-dependent deterioration, position-dependent learning and past sequence-dependent setup times. Optim Lett 7(8):1793–1804

    Article  MathSciNet  MATH  Google Scholar 

  • Ji M, Yao D, Yang Q, Cheng TCE (2015) Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity. Intl Trans Oper Res 22(6):997–1015

    Article  MathSciNet  MATH  Google Scholar 

  • Kirkpatrick S, Gelatt C, Vecchi M (1983) Optimization by simulated annealing. Science 220(4598):671–680

    Article  MathSciNet  MATH  Google Scholar 

  • Koulamas C, Kyparisis GJ (2008) Single-machine scheduling problems with past-sequence-dependent setup times. Eur J Oper Res 187(3):1045–1049

    Article  MathSciNet  MATH  Google Scholar 

  • Kuo W-H, Yang D-L (2007) Single-machine scheduling with past-sequence-dependent setup times and learning effects. Inf Process Lett 102(1):22–26

    Article  MathSciNet  MATH  Google Scholar 

  • Kuo W-H, Hsu C-J, Yang D-L (2011) Some unrelated parallel machine scheduling problems with past-sequence-dependent setup time and learning effects. Comput Ind Eng 61(1):179–183

    Article  MATH  Google Scholar 

  • Lai K, Hsu P-H, Ting P-H, Wu C-C (2014) A truncated sum of processing-times-based learning model for a two-machine flowshop scheduling problem. Hum Fact Ergon Manuf Ser Ind 24(2):152–160

    Article  Google Scholar 

  • Lee W-C (2011) A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time. Comput Math Appl 62(4):2095–2100

    Article  MathSciNet  MATH  Google Scholar 

  • Li X-J, Wang J-J, Wang X-R (2015) Single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times. Asia Pac J Oper Res 32(3):1550033

    Article  MathSciNet  MATH  Google Scholar 

  • Lu Y-Y, Teng F, Feng Z-X (2015) Scheduling jobs with truncated exponential sum-of-logarithm-processing-times based and position-based learning effects. Asia Pac J Oper Res. 32(3):1550026

    Article  MathSciNet  MATH  Google Scholar 

  • Mani V, Chang P-C, Chen S-H (2011) Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis. Int J Syst Sci 42(12):2097–2102

    Article  MathSciNet  MATH  Google Scholar 

  • Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the \(m\)-machine, \(n\)-job flow-shop sequencing problem. Omega 11(1):91–95

    Article  Google Scholar 

  • Niu Y-P, Wan L, Wang J-B (2015) A note on scheduling jobs with extended sum-of-processing-times-based and position-based learning effect. Asia Pac J Oper Res 32(2):1550001

    Article  MathSciNet  MATH  Google Scholar 

  • Soroush HM (2014) Scheduling in bicriteria single machine systems with past-sequence-dependent setup times and learning effects. J Oper Res Soc 65(7):1017–1036

    Article  Google Scholar 

  • Sun X, Geng X, Liu F (2021) Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time. J Oper Res Soc 72(12):2674–2689

    Article  Google Scholar 

  • Townsend W (1978) The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Manage Sci 24(5):530–534

    Article  MATH  Google Scholar 

  • Wang J-B (2008) Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect. Comput Ind Eng 55(3):584–591

    Article  Google Scholar 

  • Wang J-B (2010) Single-machine scheduling with a sum-of-actual-processing-time-based learning effect. J Oper Res Soc 61(2):172–177

    Article  MATH  Google Scholar 

  • Wang J-B, Li J-X (2011) Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects. Appl Math Model 35(3):1388–1395

    Article  MathSciNet  MATH  Google Scholar 

  • Wang J-B, Liang X-X (2019) Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint. Eng Optim 51(2):231–246

    Article  MathSciNet  Google Scholar 

  • Wang X-R, Wang J-B (2010) Scheduling with past-sequence-dependent setup times and learning effects on a single machine. Int J Adv Manuf Technol 48(5):739–746

    Article  Google Scholar 

  • Wang X-Y, Wang J-J (2013) Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning. Appl Math Model 37(7):4905–4914

    Article  MathSciNet  MATH  Google Scholar 

  • Wang J-B, Wang J-J (2014) Flowshop scheduling with a general exponential learning effect. Comput Oper Res 43:292–308

    Article  MathSciNet  MATH  Google Scholar 

  • Wang J-B, Wang D, Wang L-Y, Lin L, Yin N, Wang W-W (2009) Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times. Comput Math Appl 57(1):9–16

    Article  MathSciNet  MATH  Google Scholar 

  • Wang J-B, Sun L-H, Sun L-Y (2010) Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect. Appl Math Model 34(10):2813–2819

    Article  MathSciNet  MATH  Google Scholar 

  • Wang J-B, Wang X-Y, Sun L-H, Sun L-Y (2013) Scheduling jobs with truncated exponential learning functions. Optim Lett 7(8):1857–1873

    Article  MathSciNet  MATH  Google Scholar 

  • Wang J-B, Liu L, Wang J-J, Li L (2018) Makespan minimization scheduling with ready times, group technology and shortening job processing times. Comput J 61(9):1422–1428

    Article  MathSciNet  Google Scholar 

  • Wang J-B, Liu F, Wang J-J (2019) Research on m-machine flow shop scheduling with truncated learning effects. Int Trans Oper Res 26(3):1135–1151

    Article  MathSciNet  Google Scholar 

  • Wang J-B, Lv D-Y, Xu J, Ji P, Li F (2021) Bicriterion scheduling with truncated learning effects and convex controllable processing times. Int Trans Oper Res 28(3):1573–1593

    Article  MathSciNet  Google Scholar 

  • Wu C-C, Cheng S-R, Wu W-H, Yin Y, Wu W-H (2013a) The single-machine total tardiness problem with unequal release times and a linear deterioration. Appl Math Comput 219(20):10401–10415

    MathSciNet  MATH  Google Scholar 

  • Wu C-C, Lee W-C, Liou M-J (2013b) Single-machine scheduling with two competing agents and learning consideration. Inform Sci 251:136–149

    Article  MathSciNet  MATH  Google Scholar 

  • Wu C-C, Wu W-H, Wu W-H, Hsu P-H, Yin Y, Xu J (2014) A single-machine scheduling with a truncated linear deterioration and ready times. Inform Sci 256:109–125

    Article  MathSciNet  MATH  Google Scholar 

  • Yin N, Wang J-B, Wang D, Wang L-Y, Wang X-Y (2010) Deteriorating jobs and learning effects on a single-machine scheduling with past-sequence-dependent setup times. Int J Adv Manuf Technol 46(5–8):707–714

    Article  Google Scholar 

  • Zhao C, Tang H (2010) Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs. Comput Ind Eng 59(4):663–666

    Article  Google Scholar 

Download references

Acknowledgements

This research was supported by the 2020 Annual Project of Education Science “13th Five-Year Plan” of Liaoning Province [grant no. JG20DB428].

Author information

Authors and Affiliations

  1. Department of Basic, Shenyang Sport University, Shenyang, 110102, People’s Republic of China

    Shuang Zhao

Authors
  1. Shuang Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shuang Zhao.

Additional information

Communicated by Hector Cancela.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhao, S. Scheduling jobs with general truncated learning effects including proportional setup times. Comp. Appl. Math. 41, 146 (2022). https://doi.org/10.1007/s40314-022-01851-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s40314-022-01851-0

Keywords

Mathematics Subject Classification

Search

Navigation