Some dominance properties for single-machine tardiness problems with sequence-dependent setup (Q5485050): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1080/00207540500543257 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2069933763 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Construction heuristics for the asymmetric TSP. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling in a sequence dependent setup environment with genetic search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Earliness-tardiness scheduling with setup considerations / rank | |||
Normal rank |
Latest revision as of 19:44, 24 June 2024
scientific article; zbMATH DE number 5050354
Language | Label | Description | Also known as |
---|---|---|---|
English | Some dominance properties for single-machine tardiness problems with sequence-dependent setup |
scientific article; zbMATH DE number 5050354 |
Statements
Some dominance properties for single-machine tardiness problems with sequence-dependent setup (English)
0 references
28 August 2006
0 references
dominance property
0 references
sequence-dependent setup
0 references
due date
0 references
single machine
0 references
branch and bound
0 references