Skip to main content
SpringerLink
Log in

Optimal Properties for Scheduling Deteriorating Jobs for the Total Completion Time Minimization

  • Conference paper
Operations Research Proceedings 2001

Part of the book series: Operations Research Proceedings 2001 ((ORP,volume 2001))

Abstract

The paper deals with a problem of scheduling deteriorating jobs on a single machine to minimize the total completion time. Deterioration of a job means that its processing time is a function of its execution start time. We present some optimal properties for three problems, which correspond to three different decreasing linear functions, whose increasing counterparts have been studied in the literature. Based on these properties, two of these problems are solved in O(n log n) time. We present also a comparison between the problems with job processing times being decreasing and increasing linear functions of their start times.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. (1999) Scheduling with time dependent processing times: Review and extensions. Journal of the Operational Research Society 50, 711–720

    Google Scholar 

  2. Bachman A., Janiak A. (1997) Scheduling jobs with special type of start time dependent processing times. Wroclaw University of Technology, Report PRE 34/97

    Google Scholar 

  3. Cheng T. C. E., Ding Q. (1998) The complexity of scheduling starting time dependent tasks with release dates. Information Processing Letters 65, 75–79

    Article  Google Scholar 

  4. Graham R. L., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G. (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 3, 287–326

    Article  Google Scholar 

  5. Ho K. I-J., Leung J. Y-T., Wei W-D. (1993) Complexity of scheduling tasks with time-dependent execution times. Information Processing Letters 48, 315–320

    Article  Google Scholar 

  6. Mosheiov G. (1991) V-shaped policies for scheduling deteriorating jobs. Operations Research 39/6, 979–991

    Article  Google Scholar 

  7. Mosheiov G. (1994) Scheduling jobs under simple linear deterioration. Computers and Operations Research 21/6, 653–659

    Article  Google Scholar 

  8. Wajs W., Grabowski P. (1996) Studies in Automatics, University of Mining and Metallurgy, Krakow

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Engineering Cybernetics, Wroclaw University of Technology, Janiszewskiego 11/17, 50-372, Wroclaw, Poland

    Aleksander Bachman & Adam Janiak

  2. Department of Automatics, University of Mining and Metallurgy, Mickiewicz Avenue 30, 30-059, Kraków, Poland

    Wieslaw Wajs

Authors
  1. Aleksander Bachman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adam Janiak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wieslaw Wajs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät 3, Institut für Logistik und Informationsmanagement, Lehrstuhl für Wirtschaftsinformatik und Operations Research, Gerhard-Mercator-Universität Duisburg, Lotharstraße 63, 47057, Duisburg, Germany

    Peter Chamoni

  2. Fakultät 3, Institut für Logistik und Informationsmanagement, Lehrstuhl für Produktionswirtschaft und Industriebetriebslehre, Gerhard-Mercator-Universität Duisburg, Lotharstraße 63, 47057, Duisburg, Germany

    Rainer Leisten

  3. Fachbreich Mathematik · Fachgebiet Diskrete Optimierung, Technische Universität Darmstadt, Schlossgartenstraße 7, 64289, Darmstadt, Germany

    Alexander Martin

  4. WestLB · Abteilung Mathematik/Operations Research, Herzogstraße 15, 40217, Düsseldorf, Germany

    Joachim Minnemann

  5. Institut für Betriebswirtschaftslehre · Fachgebiet Fertigungs- und Materialwirtschaft, Technische Universität Darmstadt, Hochschulstraße 1, 64289, Darmstadt, Germany

    Hartmut Stadtler

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bachman, A., Janiak, A., Wajs, W. (2002). Optimal Properties for Scheduling Deteriorating Jobs for the Total Completion Time Minimization. In: Chamoni, P., Leisten, R., Martin, A., Minnemann, J., Stadtler, H. (eds) Operations Research Proceedings 2001. Operations Research Proceedings 2001, vol 2001. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-50282-8_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-50282-8_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43344-6

  • Online ISBN: 978-3-642-50282-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation