Due-date assignment and single machine scheduling with deteriorating jobs

Due-date assignment and single machine scheduling with deteriorating jobs

We study a scheduling problem with deteriorating jobs, that is, jobs whose processing times are an increasing function of their start times. We consider the case of a single machine and linear job-independent deterioration. The problem is to determine an optimal combination of the due-date and sched...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of the Operational Research Society 2004-02, Vol.55 (2), p.198-203
Hauptverfasser: Cheng, T C E, Kang, L, Ng, C T
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Business and Management
Cost functions
Costs
deteriorating jobs
due-date
Efficiency
Exact sciences and technology
Increasing functions
Ingots
Integers
Job shops
Lateness
Management
Mathematical models
Operational research and scientific management
Operational research. Management science
Operations research
Operations Research/Decision Theory
Optimal solutions
Production scheduling
Scheduling
Scheduling, sequencing
single machine scheduling
Steel production
Studies
Theoretical Paper
Theoretical Papers
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study a scheduling problem with deteriorating jobs, that is, jobs whose processing times are an increasing function of their start times. We consider the case of a single machine and linear job-independent deterioration. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of due-date, earliness and tardiness penalties. We give an O(n log n) time algorithm to solve this problem.
ISSN:0160-5682
1476-9360
DOI:10.1057/palgrave.jors.2601681