Optimal total-work-content-power due-date determination and sequencing (Q1097161)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1097161 |
scientific article; zbMATH DE number 4033469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal total-work-content-power due-date determination and sequencing |
scientific article; zbMATH DE number 4033469 |
Statements
Optimal total-work-content-power due-date determination and sequencing (English)
0 references
1987
0 references
This paper considers sequencing of n jobs on a single machine. The total- work-content-power (TWK-P) due-date assignment method is used to assign due-dates to jobs. The objective is to determine the optimal due-date multiple factor so as to minimize a cost function based on the due-date multiple and job earliness, and tardiness values. A linear programming (LP) formulation of the problem is proposed and the optimal solution is determined via considering the LP dual problem.
0 references
sequencing
0 references
single machine
0 references
due-date assignment
0 references
earliness
0 references
tardiness
0 references
0 references
0.8982267379760742
0 references
0.89573734998703
0 references
0.8950252532958984
0 references
0.8950006365776062
0 references
0.8616948127746582
0 references