Skip to main content
SpringerLink
Log in

Parallel Machine Scheduling of Deteriorating Jobs by Modified Steepest Descent Search

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,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.

The research has been partially supported by grant no. 4T11C 03925 of the Ministry of Science and Information Society Technologies of Poland.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alidaee, B., Womer, N.K.: Scheduling with time dependent processing times: Review and extensions. J. Optl Res. Soc. 50, 711–720 (1999)

    Article  MATH  Google Scholar 

  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. 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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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. Kononov, A.: Combinatorial complexity of scheduling jobs with simple linear deterioration. Diskret. Anal. Issled. Oper. (in Russian) 3, 15–32 (1996)

    MATH  Google Scholar 

  8. Mosheiov, G.: Scheduling jobs under simple linear deterioration. Computers and Oper. Res. 21, 653–659 (1994)

    Article  MATH  Google Scholar 

  9. Mosheiov, G.: Multi-machine scheduling with linear deterioration. Infor. 36, 205–214 (1998)

    Google Scholar 

  10. Mosheiov, G.: Complexity analysis of job-scheduling with deteriorating jobs. Discr. Appl. Math. 117, 195–209 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Umultowska 87, 61-614, Poznań, Poland

    Stanisław Gawiejnowicz, Wiesław Kurc & Lidia Pankowska

Authors
  1. Stanisław Gawiejnowicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wiesław Kurc
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lidia Pankowska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computational and Information Sciences, Czestochowa University of Technology, Poland

    Roman Wyrzykowski

  2. Computer Science Department,, University of Tennessee, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

  3. Poznan Supercomputing and Networking Center, Poland

    Norbert Meyer

  4. Informatics & Mathematical Modeling, Technical University of Denmark, 2800, Lyngby, DK, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gawiejnowicz, S., Kurc, W., Pankowska, L. (2006). Parallel Machine Scheduling of Deteriorating Jobs by Modified Steepest Descent Search. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_15

Download citation

  • DOI: https://doi.org/10.1007/11752578_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34141-3

  • Online ISBN: 978-3-540-34142-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation