Single machine scheduling and due date assignment with positionally dependent processing times

We consider single machine scheduling and due date assignment problems in which the processing time of a job depends on its position in a processing sequence. The objective functions include the cost of changing the due dates, the total cost of discarded jobs that cannot be completed by their due da...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:European journal of operational research Ročník 198; číslo 1; s. 57 - 62
Hlavní autori: Gordon, Valery S., Strusevich, Vitaly A.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 01.10.2009
Elsevier
Elsevier Sequoia S.A
Edícia:European Journal of Operational Research
Predmet:
Applied sciences
Assignment problem
Common due date assignment
Deadlines
Dynamic programming
Exact sciences and technology
Inventory control, production control. Distribution
Job shops
Logistics
Mathematical programming
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Positionally dependent processing times
Production scheduling
Scheduling, sequencing
Single machine scheduling
Single machine scheduling Common due date assignment SLK due date assignment Positionally dependent processing times
SLK due date assignment
Studies
Positionally dependent processing times
Common due date assignment
SLK due date assignment
Single machine scheduling
Processing time
Scheduling
Polynomial method
Modeling
Due date
Polynomial time
Time dependence
Cooperation
Cost function
Matrix polynomial
Earliness
Objective function
Dynamic programming
Single machine
Logistics
Mathematical programming
Execution time
ISSN:0377-2217, 1872-6860
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We consider single machine scheduling and due date assignment problems in which the processing time of a job depends on its position in a processing sequence. The objective functions include the cost of changing the due dates, the total cost of discarded jobs that cannot be completed by their due dates and, possibly, the total earliness of the scheduled jobs. We present polynomial-time dynamic programming algorithms in the case of two popular due date assignment methods: CON and SLK. The considered problems are related to mathematical models of cooperation between the manufacturer and the customer in supply chain scheduling.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2008.07.044