Scheduling linear deteriorating jobs with rejection on a single machine

We consider several single machine scheduling problems in which the processing time of a job is a linear function of its starting time and jobs can be rejected by paying penalties. The objectives are to minimize the makespan, the total weighted completion time and the maximum lateness/tardiness plus...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 194; číslo 1; s. 18 - 27
Hlavní autoři: Cheng, Yushao, Sun, Shijie
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.04.2009
Elsevier
Elsevier Sequoia S.A
Edice:European Journal of Operational Research
Témata:
Algorithms
Applied sciences
Deteriorating jobs
Dynamic programming
Exact sciences and technology
Inventory control, production control. Distribution
Job shops
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Production scheduling
Rejection
Scheduling
Scheduling Deteriorating jobs Rejection Dynamic programming
Scheduling, sequencing
Studies
Rejection
Scheduling
Dynamic programming
Deteriorating jobs
Optimal algorithm
Task scheduling
Processing time
Makespan
Polynomial method
Approximation algorithm
Delay
Workload
Polynomial time
Minimum time
NP hard problem
Lateness
Matrix polynomial
Single machine
Mathematical programming
Completion time
Execution time
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider several single machine scheduling problems in which the processing time of a job is a linear function of its starting time and jobs can be rejected by paying penalties. The objectives are to minimize the makespan, the total weighted completion time and the maximum lateness/tardiness plus the total penalty of the rejected jobs. We show that these problems are NP-hard, and design algorithms based on dynamic programming (including pseudo-polynomial time optimal algorithms and fully polynomial time approximation schemes) to solve them.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2007.11.047