Scheduling with monotonous earliness and tardiness penalties (Q2366084): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 07:52, 5 March 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
    0 references
    pseudopolynomial algorithm
    0 references
    just-in-time
    0 references
    nonpreemptable jobs
    0 references
    one machine
    0 references
    due-dates
    0 references