Production scheduling of independent jobs on parallel identical processors (Q3346074)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3880419
Language Label Description Also known as
default for all languages
No label defined
    English
    Production scheduling of independent jobs on parallel identical processors
    scientific article; zbMATH DE number 3880419

      Statements

      Production scheduling of independent jobs on parallel identical processors (English)
      0 references
      0 references
      1984
      0 references
      independent jobs
      0 references
      parallel identical processors
      0 references
      nested dynamic programming
      0 references
      This paper studies the scheduling of n independent jobs available at the same time on m parallel identical processors where each jobs requires single stage processing on any one of the processors and a cost function is minimized, including initial fixed costs of using machines as well as costs of processing jobs so that the number of machines used is not fixed but a variable to be determined. An optimization algorithm based on a nested dynamic programming approach is presented, imbedding Held and Karp's single recursive equation [see \textit{M. Held} and \textit{R. M. Karp}, SIAM J. Appl. Math. 10, 196-210 (1962; Zbl 0106.141)] into another recursive one for extending to multi processors. This algorithm can be applicable to quite general cost functions, but it appears to be applicable up to 18 jobs within a reasonable computing time.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references