An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs (Q2483505): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q126269522, #quickstatements; #temporary_batch_1722209980517 |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2014257991 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A survey of the state-of-the-art of common due date assignment and scheduling research / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The parallel machine min-max weighted absolute lateness scheduling problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3056948 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4773298 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q126269522 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 00:48, 29 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs |
scientific article |
Statements
An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs (English)
0 references
28 April 2008
0 references
analysis of algorithms
0 references
due-date assignment
0 references
earliness-tardiness
0 references
scheduling
0 references
0 references