Production problems with deadline penalties (Q3738897)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3972605
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Production problems with deadline penalties |
scientific article; zbMATH DE number 3972605 |
Statements
Production problems with deadline penalties (English)
0 references
1986
0 references
total penalty function
0 references
due dates
0 references
0 references
0 references
0.8030986189842224
0 references
0.802335262298584
0 references
0.7990186214447021
0 references
0.7927954196929932
0 references
This paper considers the scheduling problem faced by a manufacturer who is required to conform strictly to previously agreed due dates (or delivery dates). Penalties are assessed in the event that the product or service delivered is not yet complete. The model allows for a disruption cost each time a delivery is made. The objective is to minimize a total penalty function based on the announced due dates, the tardiness of each job and the number of distinct due dates used. The problem is solved by an efficient algorithm which simultaneously finds optimal solutions for the number of due dates to use, the specifications of those due dates and the order of processing for the jobs. A numerical example demonstrates the operation of the algorithm.
0 references