Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
On Single Machine Scheduling and Due DateAssignment with Positionally Dependent Processing Times
verfasst von : Valery S. Gordon, Vitaly A. Strusevich
Erschienen in: Operations Research Proceedings 2008
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper addresses single machine scheduling problems in which the decision-maker controls two parameters: the due dates of the jobs and the processing times. In the problems under consideration, the jobs have to be assigned the due dates and the objective includes the cost of such an assignment, the total cost of discarded jobs and, possibly, the holding cost of the early jobs represented in the form of total earliness. The processing times of the jobs are not constant but depend on the position of a job in a schedule. We mainly focus on scheduling models with a deterioration effect. Informally, under deterioration the processing time is not a constant but changes according to some rule, so that the later a job starts, the longer it takes to process. An alternative type of scheduling models with non-constant processing times are models with a learning effect, in which the later a job starts, the shorter its processing time is. The two types of models are close but not entirely symmetric.