Parallel machine scheduling of deteriorating jobs by modified steepest descent search

  • Authors:

  • Stanisław Gawiejnowicz;Wiesław Kurc;Lidia Pankowska

  • Affiliations:

  • Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland;Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland;Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland

  • Venue:
  • PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.