Article thumbnail
Location of Repository

Simple matching vs linear assignment in scheduling models with positional effects: A critical review

By Kabir Rustogi and Vitaly A. Strusevich

Abstract

This paper addresses scheduling models in which a contribution of an individual job to the objective function is represented by the product of its processing time and a certain positional weight. We review most of the known results in the area and demonstrate that a linear assignment algorithm as part of previously known solution procedures can be replaced by a faster matching algorithm that minimizes a linear form over permutations. Our approach reduces the running time of the resulting algorithms by up to two orders, and carries over to a wider range of models, with more general positional effects. Besides, the same approach works for the models with no prior history of study, e.g., parallel machine scheduling with deterioration and maintenance to minimize total flow time

Topics: QA
Publisher: Elsevier B.V.
Year: 2012
DOI identifier: 10.1016/j.ejor.2012.04.037
OAI identifier: oai:gala.gre.ac.uk:9024
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://dx.doi.org/10.1016/j.ej... (external link)
  • http://www.journals.elsevier.c... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.