Heuristic dispatching rule to maximize TDD and IDD performance (Q4671362): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The choice of dispatching rules in a shop using internally set due-dates with quoted leadtime and tardiness costs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integrating order release control with due-date assignment rules / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mixing macro and micro flowtime estimation model: Wafer fab example / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved heuristics for the \(n\)-job single-machine weighted tardiness problem / rank | |||
Normal rank |
Latest revision as of 10:31, 10 June 2024
scientific article; zbMATH DE number 2161446
Language | Label | Description | Also known as |
---|---|---|---|
English | Heuristic dispatching rule to maximize TDD and IDD performance |
scientific article; zbMATH DE number 2161446 |
Statements
Heuristic dispatching rule to maximize TDD and IDD performance (English)
0 references
26 April 2005
0 references
0 references
0 references
0 references