Skip to main content
Top
Published in: Neural Computing and Applications 7/2016

01-10-2016 | Original Article

Resource-dependent scheduling with deteriorating jobs and learning effects on unrelated parallel machine

Authors: Yuan-Yuan Lu, Jian Jin, Ping Ji, Ji-Bo Wang

Published in: Neural Computing and Applications | Issue 7/2016

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The focus of this paper is to analyze unrelated parallel-machine resource allocation scheduling problem with learning effect and deteriorating jobs. The goal is to find the optimal sequence of jobs and the optimal resource allocation separately for minimizing the cost function including the total load, the total completion time, the total absolute deviation of completion time and the total resource cost. We show that the problem is polynomial time solvable if the number of machines is a given constant.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Bagchi UB (1989) Simultaneous minimization of mean and variation of flow-time and waiting time in single machine systems. Oper Res 37:118–125MathSciNetCrossRefMATH Bagchi UB (1989) Simultaneous minimization of mean and variation of flow-time and waiting time in single machine systems. Oper Res 37:118–125MathSciNetCrossRefMATH
3.
go back to reference Cheng TCE, Wu C-C, Lee W-C (2008) Some scheduling problems with deteriorating jobs and learning effects. Comput Ind Eng 54:972–982CrossRef Cheng TCE, Wu C-C, Lee W-C (2008) Some scheduling problems with deteriorating jobs and learning effects. Comput Ind Eng 54:972–982CrossRef
4.
go back to reference Eren T (2009) A bicriteria parallel machine scheduling with a learning effect of setup and removal times. Appl Math Model 33:1141–1150MathSciNetCrossRefMATH Eren T (2009) A bicriteria parallel machine scheduling with a learning effect of setup and removal times. Appl Math Model 33:1141–1150MathSciNetCrossRefMATH
5.
go back to reference Gawiejnowicz S (2008) Time-dependent scheduling. Springer, BerlinMATH Gawiejnowicz S (2008) Time-dependent scheduling. Springer, BerlinMATH
6.
go back to reference Geyik F, Dosdoǧru AT (2013) Process plan and part routing optimization in a dynamic flexible job shop scheduling environment: an optimization via simulation approach. Neural Comput Appl 23:1631–1641CrossRef Geyik F, Dosdoǧru AT (2013) Process plan and part routing optimization in a dynamic flexible job shop scheduling environment: an optimization via simulation approach. Neural Comput Appl 23:1631–1641CrossRef
7.
go back to reference Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326MathSciNetCrossRefMATH Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326MathSciNetCrossRefMATH
8.
go back to reference 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 Model 35:1492–1496MathSciNetCrossRefMATH 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 Model 35:1492–1496MathSciNetCrossRefMATH
9.
go back to reference Hsu C-J, Yang D-L (2014) Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time. Optim Lett 8:519–531MathSciNetCrossRefMATH Hsu C-J, Yang D-L (2014) Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time. Optim Lett 8:519–531MathSciNetCrossRefMATH
10.
go back to reference Hsu C-J, Yang S-J, Yang D-L (2011) Two due date assignment problems with position-dependent processing time on a single-machine. Comput Ind Eng 60:796–800CrossRef Hsu C-J, Yang S-J, Yang D-L (2011) Two due date assignment problems with position-dependent processing time on a single-machine. Comput Ind Eng 60:796–800CrossRef
11.
12.
go back to reference Jiang Z, Chen F, Kang H (2013) Single-machine scheduling problems with actual time-dependent and job-dependent learning effect. Eur J Oper Res 227:76–80MathSciNetCrossRefMATH Jiang Z, Chen F, Kang H (2013) Single-machine scheduling problems with actual time-dependent and job-dependent learning effect. Eur J Oper Res 227:76–80MathSciNetCrossRefMATH
13.
go back to reference Kanet JJ (1981) Minimizing variation of flow time in single machine systems. Manag Sci 27:1453–1459CrossRefMATH Kanet JJ (1981) Minimizing variation of flow time in single machine systems. Manag Sci 27:1453–1459CrossRefMATH
14.
go back to reference Lu Y-Y, Wang J-J, Wang J-B (2014) Single machine group scheduling with decreasing time-dependent processing times subject to release dates. Appl Math Comput 234:286–292MathSciNetMATH Lu Y-Y, Wang J-J, Wang J-B (2014) Single machine group scheduling with decreasing time-dependent processing times subject to release dates. Appl Math Comput 234:286–292MathSciNetMATH
15.
go back to reference Mor B, Mosheiov G (2011) Total absolute deviation of job completion times on uniform and unrelated machines. Comput Oper Res 38:660–665MathSciNetCrossRefMATH Mor B, Mosheiov G (2011) Total absolute deviation of job completion times on uniform and unrelated machines. Comput Oper Res 38:660–665MathSciNetCrossRefMATH
16.
go back to reference Okołowski D, Gawiejnowicz S (2010) Exact and heuristic algorithms for parallel-machine scheduling with DeJong’s learning effect. Comput Ind Eng 59:272–279CrossRef Okołowski D, Gawiejnowicz S (2010) Exact and heuristic algorithms for parallel-machine scheduling with DeJong’s learning effect. Comput Ind Eng 59:272–279CrossRef
17.
go back to reference Panwalkar SS, Rajagopalan R (1992) Single machine sequencing with controllable processing times. Eur J Oper Res 59:298–302CrossRefMATH Panwalkar SS, Rajagopalan R (1992) Single machine sequencing with controllable processing times. Eur J Oper Res 59:298–302CrossRefMATH
18.
go back to reference Pinedo M (2002) Scheduling: theory, algorithms, and systems, upper saddle river. Prentice-hall, Upper Saddle River Pinedo M (2002) Scheduling: theory, algorithms, and systems, upper saddle river. Prentice-hall, Upper Saddle River
19.
go back to reference Rudek R, Rudek A, Kozik A (2013) The solution algorithms for the multiprocessor scheduling with workspan criterion. Expert Syst Appl 40:2799–2806CrossRef Rudek R, Rudek A, Kozik A (2013) The solution algorithms for the multiprocessor scheduling with workspan criterion. Expert Syst Appl 40:2799–2806CrossRef
20.
21.
go back to reference Shabtay D, Steiner G (2008) The single-machine earlinesstardiness scheduling problem with due date assignment and resource-dependent processing times. Ann Oper Res 159(1):25–40MathSciNetCrossRefMATH Shabtay D, Steiner G (2008) The single-machine earlinesstardiness scheduling problem with due date assignment and resource-dependent processing times. Ann Oper Res 159(1):25–40MathSciNetCrossRefMATH
23.
go back to reference Wang J-B (2010) Single-machine scheduling with a sum-of-actual-processing-time-based learning effect. J Oper Res Soc 61:172–177CrossRefMATH Wang J-B (2010) Single-machine scheduling with a sum-of-actual-processing-time-based learning effect. J Oper Res Soc 61:172–177CrossRefMATH
24.
go back to reference Wang J-B, Hsu C-J, Yang D-L (2013) Single-machine scheduling with effects of exponential learning and general deterioration. Appl Math Model 37:2293–2299MathSciNetCrossRef Wang J-B, Hsu C-J, Yang D-L (2013) Single-machine scheduling with effects of exponential learning and general deterioration. Appl Math Model 37:2293–2299MathSciNetCrossRef
25.
go back to reference Wang J-B, Liu L, Wang C (2013) Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs. Appl Math Model 37:8394–8400MathSciNetCrossRef Wang J-B, Liu L, Wang C (2013) Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs. Appl Math Model 37:8394–8400MathSciNetCrossRef
26.
go back to reference Wang J-B, Wang M-Z (2011) Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects. Ann Oper Res 191:155–169MathSciNetCrossRefMATH Wang J-B, Wang M-Z (2011) Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects. Ann Oper Res 191:155–169MathSciNetCrossRefMATH
28.
go back to reference Wang J-B, Wang M-Z (2012) Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time. Comput Oper Res 39:492–497MathSciNetCrossRefMATH Wang J-B, Wang M-Z (2012) Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time. Comput Oper Res 39:492–497MathSciNetCrossRefMATH
29.
go back to reference Wang X-R, Wang J-J (2013) Single-machine scheduling with convex resource dependent processing times and deteriorating jobs. Appl Math Model 37:2388–2393MathSciNetCrossRef Wang X-R, Wang J-J (2013) Single-machine scheduling with convex resource dependent processing times and deteriorating jobs. Appl Math Model 37:2388–2393MathSciNetCrossRef
30.
go back to reference 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:4905–4914MathSciNetCrossRef 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:4905–4914MathSciNetCrossRef
31.
go back to reference Wang X-Y, Wang J-J (2014) Scheduling deteriorating jobs with a learning effect on unrelated parallel machines. Appl Math Model 38:5231–5238MathSciNetCrossRef Wang X-Y, Wang J-J (2014) Scheduling deteriorating jobs with a learning effect on unrelated parallel machines. Appl Math Model 38:5231–5238MathSciNetCrossRef
32.
go back to reference Wang J-B, Wang J-J (2014) Single machine group scheduling with time dependent processing times and ready times. Inf Sci 275:226–231MathSciNetCrossRefMATH Wang J-B, Wang J-J (2014) Single machine group scheduling with time dependent processing times and ready times. Inf Sci 275:226–231MathSciNetCrossRefMATH
33.
go back to reference Wang J-B, Wang M-Z and Ji P (2012) Scheduling jobs with processing times dependent on position, starting time and allotted resource, Asia-Pacific Journal of Operational Research, vol. 29, Article ID 1250030 Wang J-B, Wang M-Z and Ji P (2012) Scheduling jobs with processing times dependent on position, starting time and allotted resource, Asia-Pacific Journal of Operational Research, vol. 29, Article ID 1250030
34.
go back to reference Wang D, Wang M-Z, Wang J-B (2010) Single-machine scheduling with learning effect and resource-dependent processing times. Comput Ind Eng 59:458–462CrossRef Wang D, Wang M-Z, Wang J-B (2010) Single-machine scheduling with learning effect and resource-dependent processing times. Comput Ind Eng 59:458–462CrossRef
35.
go back to reference Weckman G, Bondal AA, Rinder MM, Young WA II (2012) Applying a hybrid artificial immune systems to the job shop scheduling problem. Neural Comput Appl 21:1465–1475CrossRef Weckman G, Bondal AA, Rinder MM, Young WA II (2012) Applying a hybrid artificial immune systems to the job shop scheduling problem. Neural Comput Appl 21:1465–1475CrossRef
36.
go back to reference Wei C-M, Wang J-B, Ji P (2012) Single-machine scheduling with time-and-resource-dependent processing times. Appl Math Model 36:792–798MathSciNetCrossRefMATH Wei C-M, Wang J-B, Ji P (2012) Single-machine scheduling with time-and-resource-dependent processing times. Appl Math Model 36:792–798MathSciNetCrossRefMATH
37.
go back to reference Xu Y-T, Zhang Y, Huang X (2014) Single-machine ready times scheduling with group technology and proportional linear deterioration. Appl Math Model 38:384–391MathSciNetCrossRef Xu Y-T, Zhang Y, Huang X (2014) Single-machine ready times scheduling with group technology and proportional linear deterioration. Appl Math Model 38:384–391MathSciNetCrossRef
38.
39.
go back to reference Yin, Y, Cheng TCE, Wu C-C (2014) Scheduling with time-dependent processing times. Math Probl Eng. Article ID 201421 Yin, Y, Cheng TCE, Wu C-C (2014) Scheduling with time-dependent processing times. Math Probl Eng. Article ID 201421
40.
go back to reference Yin Y, Cheng TCE, Wan L, Wu C-C, Liu J (2015) Two-agent single-machine scheduling with deteriorating jobs. Comput Ind Eng 81:177–185CrossRef Yin Y, Cheng TCE, Wan L, Wu C-C, Liu J (2015) Two-agent single-machine scheduling with deteriorating jobs. Comput Ind Eng 81:177–185CrossRef
41.
go back to reference Yin N, Kang L, Ji P, Wang J-B (2014) Single machine scheduling with sum-of-logarithm-processing-times based deterioration. Inf Sci 274:303–309MathSciNetCrossRefMATH Yin N, Kang L, Ji P, Wang J-B (2014) Single machine scheduling with sum-of-logarithm-processing-times based deterioration. Inf Sci 274:303–309MathSciNetCrossRefMATH
42.
go back to reference Yin N, Kang L, Wang X-Y (2014) Single-machine group scheduling with processing times dependent on position, starting time and allotted resource. Appl Math Model 38:4602–4613MathSciNetCrossRef Yin N, Kang L, Wang X-Y (2014) Single-machine group scheduling with processing times dependent on position, starting time and allotted resource. Appl Math Model 38:4602–4613MathSciNetCrossRef
43.
go back to reference Yin Y, Wu W-H, Cheng TCE, Wu C-C (2015) Single-machine scheduling with time-dependent and position-dependent deteriorating jobs. Int J Comput Integr Manuf 28:781–790CrossRef Yin Y, Wu W-H, Cheng TCE, Wu C-C (2015) Single-machine scheduling with time-dependent and position-dependent deteriorating jobs. Int J Comput Integr Manuf 28:781–790CrossRef
44.
go back to reference Zhang G-Q, Wang J-J and Liu Y-J (2014) Scheduling jobs with variable job processing times on unrelated parallel machines. Sci World J, Article ID 242107 Zhang G-Q, Wang J-J and Liu Y-J (2014) Scheduling jobs with variable job processing times on unrelated parallel machines. Sci World J, Article ID 242107
Metadata
Title
Resource-dependent scheduling with deteriorating jobs and learning effects on unrelated parallel machine
Authors
Yuan-Yuan Lu
Jian Jin
Ping Ji
Ji-Bo Wang
Publication date
01-10-2016
Publisher
Springer London
Published in
Neural Computing and Applications / Issue 7/2016
Print ISSN: 0941-0643
Electronic ISSN: 1433-3058
DOI
https://doi.org/10.1007/s00521-015-1993-x

Other articles of this Issue 7/2016

Neural Computing and Applications 7/2016 Go to the issue

Premium Partner