Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs (Q4367301): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199704)44:3<287::aid-nav4>3.0.co;2-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034026395 / rank
 
Normal rank
Property / title
 
Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs (English)
Property / title: Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs (English) / rank
 
Normal rank

Latest revision as of 08:51, 30 July 2024

scientific article; zbMATH DE number 1091579
Language Label Description Also known as
English
Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
scientific article; zbMATH DE number 1091579

    Statements

    0 references
    0 references
    25 November 1997
    0 references
    parallel machines
    0 references
    maximum earliness or tardiness
    0 references
    worst-case bounds
    0 references
    Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs (English)
    0 references

    Identifiers