A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem (Q913649)
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 4147851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem |
scientific article; zbMATH DE number 4147851 |
Statements
A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem (English)
0 references
1990
0 references
The problem considered consists in assigning a common-due-date to a set of simultaneously available jobs and sequencing them on a single-machine. The objective is to find an optimal combination of the due-date value and job sequence to minimize a penalty function based on the weighted sum of job earliness and tardiness values. Being a follow-up study to an earlier work of the author [ibid. 14, 537-542 (1987; Zbl 0634.90030)], this note presents a new algorithm which is shown to be significantly more efficient than the previous one for solving the problem.
0 references
common-due-date
0 references
simultaneously available jobs
0 references
sequencing
0 references
single- machine
0 references
earliness and tardiness values
0 references
0.8511371612548828
0 references
0.8493914008140564
0 references
0.8432000279426575
0 references
0.8424893617630005
0 references
0.8422659039497375
0 references
