Scheduling Jobs with Start Time and Resource Dependent Processing Times

  • Daniel Iwanowski
  • Adam Janiak
  • Adrian Rogala
Conference paper
Part of the Operations Research Proceedings 1999 book series (ORP, volume 1999)

Abstract

This paper deals with the single machine scheduling problems, where the job processing times are given as linear functions dependent on the processing start time and the amount of resources allocated to the jobs. We consider two problems: the first one deals with the makespan minimization where the total amount of resources is limited; in the second one the value of makespan is limited and the considered criterion is the minimization of the total resource consumption. We present optimal algorithms for some special cases of the first problem. For the second problem we present a solving method which can be applied if only the symmetrical version of the problem is solvable in polynomial time and some additional conditions are satisfied.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Alidaee B.: A heuristic solution procedure to minimize makespan with non-linear cost functions, Journal of the Operations Research Society, Vol. 41/11, 1990, pp. 1065–1068.Google Scholar
  2. [2]
    Alidaee B., Landram F.: Scheduling deteriorating jobs on a single machine to minimize the maximum processing times, International Journal of System Science, Vol. 27, No. 5, 1995, pp. 507–510.CrossRefGoogle Scholar
  3. [3]
    Bachman A.: Single machine scheduling problems for the jobs with start time dependent processing times (PhD Dissertation), Institute of Engineering Cybernetics, Wroclaw University of Technology, Wroclaw 1999 (in Polish).Google Scholar
  4. [4]
    Daniels L. R.: Resource allocation and multi-project scheduling in: Advances in Project Scheduling, Slowinski R., Wȩglarz J. (eds.) Elsevier Sci. Publish., 1989.Google Scholar
  5. [5]
    Ho K. I-J., Leung J. Y-T., Wei W-D.: Complexity of scheduling tasks with time-dependent execution times, Information Processing Letters, Vol. 48, 1993, pp. 315–320.CrossRefGoogle Scholar
  6. [6]
    Janiak A., Grabowski J.: Optimization of a sequence of operations in control of discrete manufacturing processes, Scientific Bulletins of Silesian Polytechnics, s. Automatics, Vol. 54, 1980, pp. 67-74 (in Polish).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Daniel Iwanowski
    • 1
  • Adam Janiak
    • 1
  • Adrian Rogala
    • 1
  1. 1.Institute of Engineering CyberneticsWroclaw University of TechnologyPoland

Personalised recommendations