Scheduling with monotonous earliness and tardiness penalties (Q2366084): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:57, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling with monotonous earliness and tardiness penalties |
scientific article |
Statements
Scheduling with monotonous earliness and tardiness penalties (English)
0 references
29 June 1993
0 references
The problem of scheduling nonpreemptable jobs on one machine, is considered. Jobs are assigned due-dates and the aim is to schedule them as close to these due-dates as possible (``just-in-time'' scheduling). The objective function should be monotonous with respect to the absolute lateness. A pseudopolynomial-in-time algorithm is given for solving the problem. For a subclass of the above mentioned objective functions this algorithm is extended to a fully polynomial approximation scheme.
0 references
pseudopolynomial algorithm
0 references
just-in-time
0 references
nonpreemptable jobs
0 references
one machine
0 references
due-dates
0 references
