Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs (Q4367301): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs | |||
| 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
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
