Parallel Machine Scheduling of Deteriorating Jobs by Modified Steepest Descent Search

  • Stanisław Gawiejnowicz
  • Wiesław Kurc
  • Lidia Pankowska
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3911)

Abstract

In the paper two problems of scheduling time-dependent jobs on parallel machines are considered. In both problems the processing time of each job is described by a linear function of the starting time of the job. The criterion of optimality of a schedule is either the total completion time or the total machine load. First, an equivalence of these two problems is proved. Next, several properties of the problems are shown. Finally, two heuristic algorithms based on the steepest descent search are proposed and results of their experimental evaluation are reported.

Keywords

deteriorating jobs parallel machine scheduling total completion time total machine load heuristic algorithms steepest descent search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alidaee, B., Womer, N.K.: Scheduling with time dependent processing times: Review and extensions. J. Optl Res. Soc. 50, 711–720 (1999)CrossRefMATHGoogle Scholar
  2. 2.
    Chen, Z.-L.: Parallel machine scheduling with time dependent processing times. Discr. Appl. Math. 70, 81–93. Erratum: Discr. Appl. Math. 75, 103 (1996)Google Scholar
  3. 3.
    Cheng, T.C.E., Ding, Q., Lin, B.M.T.: A concise survey of scheduling with time-dependent processing times. Euro. J. Optl Res. 152, 1–13 (2004)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Graham, R.E., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discr. Math. 4, 287–326 (1979)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Hindi, K.S., Mhlanga, S.: Scheduling linearly deteriorating jobs on parallel machines: A simulated annealing approach. Prod. Planning and Control 12, 76–80 (2001)CrossRefGoogle Scholar
  6. 6.
    Jeng, A.A.-K., Lin, B.M.-T.: Parallel-machine scheduling with deteriorating jobs to minimize total completion time April 2004 (unpublished manuscript)Google Scholar
  7. 7.
    Kononov, A.: Combinatorial complexity of scheduling jobs with simple linear deterioration. Diskret. Anal. Issled. Oper. (in Russian) 3, 15–32 (1996)MATHGoogle Scholar
  8. 8.
    Mosheiov, G.: Scheduling jobs under simple linear deterioration. Computers and Oper. Res. 21, 653–659 (1994)CrossRefMATHGoogle Scholar
  9. 9.
    Mosheiov, G.: Multi-machine scheduling with linear deterioration. Infor. 36, 205–214 (1998)Google Scholar
  10. 10.
    Mosheiov, G.: Complexity analysis of job-scheduling with deteriorating jobs. Discr. Appl. Math. 117, 195–209 (2002)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Stanisław Gawiejnowicz
    • 1
  • Wiesław Kurc
    • 1
  • Lidia Pankowska
    • 1
  1. 1.Faculty of Mathematics and Computer ScienceAdam Mickiewicz UniversityPoznańPoland

Personalised recommendations