Location of Repository

Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation

By V.S. Gordon, C.N. Potts, V.A. Strusevich and J.D. Whitehead

Abstract

We consider various single machine scheduling problems in which the processing time of a job depends either on its position in a processing sequence or on its start time. We focus on problems of minimizing the makespan or the sum of (weighted) completion times of the jobs. In many situations we show that the objective function is priority-generating, and therefore the corresponding scheduling problem under series-parallel precedence constraints is polynomially solvable. In other situations we provide counter-examples that show that the objective function is not priority-generating

Topics: QA
Year: 2008
OAI identifier: oai:eprints.soton.ac.uk:156307
Provided by: e-Prints Soton
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.1007/s109... (external link)
  • Suggested articles


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