Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Processing and Applied Mathematics

PPAM 2003: Parallel Processing and Applied Mathematics pp 89–96Cite as

Minimizing Time-Dependent Total Completion Time on Parallel Identical Machines

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3019))

Abstract

In the paper a problem of minimizing the total completion time for deteriorating jobs and parallel identical machines is considered. The processing time of each job is a linear function of the starting time of the job. The properties of an optimal schedule are proved and a greedy heuristic for the problem is proposed. Preliminary results of experimental evaluation of the algorithm are given.

The research has been partially supported by KBN grant no. 4T11C 03925.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aigner, M.: Combinatorial theory. Springer, Heidelberg (1979)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  3. Chen, Z.-L.: Parallel machine scheduling with time dependent processing times. Discr. Appl. Math. 70, 81–93 (1996) Erratum: Discr. Appl. Math. 75, 103 (1996)

    Article  MATH  Google Scholar 

  4. Cheng, T.C.E., Ding, Q., Lin, B.M.T.: A concise survey of scheduling with timedependent processing times. Euro. J. Optl. Res. 152, 1–13 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gawiejnowicz, S., Kurc, W., Pankowska, L.: A greedy approach for a timedependent scheduling problem. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2001. LNCS, vol. 2328, pp. 79–86. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Gawiejnowicz, S., Kurc, W., Pankowska, L., Suwalski, C.: Approximate solution of a time-dependent scheduling problem for lp-norm-based criteria. In: Fleischmann, B., et al. (eds.) Proceedings Operations Research, pp. 372–377. Springer, Heidelberg (2001)

    Google Scholar 

  7. Kononov, A.: Combinatorial complexity of scheduling jobs with simple linear deterioration. Discr. Anal. Oper. Res. 3(2), 15–32 (1996) (in Russian)

    MATH  MathSciNet  Google Scholar 

  8. Kononov, A.: Scheduling problems with linear processing times. In: Zimmermann, U., et al. (eds.) Proceedings Operations Research, pp. 208–212. Springer, Heidelberg (1997)

    Google Scholar 

  9. Kononov, A., Gawiejnowicz, S.: NP-hard cases in scheduling deteriorating jobs on dedicated machines. J. Optl. Res. Soc. 52, 708–717 (2001)

    Article  MATH  Google Scholar 

  10. Mosheiov, G.: V-shaped policies to schedule deteriorating jobs. Oper. Res. 39(6), 979–991 (1991)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  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,  

    Roman Wyrzykowski

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

    Jack Dongarra

  3. Systems Research Institute, Polish Academy of Science, Warsaw, Poland

    Marcin Paprzycki

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

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gawiejnowicz, S., Kurc, W., Pankowska, L. (2004). Minimizing Time-Dependent Total Completion Time on Parallel Identical Machines. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24669-5_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21946-0

  • Online ISBN: 978-3-540-24669-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation