A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness (Q869149): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2005.06.069 / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/eor/LuoC07 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2005.06.069 / rank | |||
Normal rank | |||
Latest revision as of 06:10, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness |
scientific article |
Statements
A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness (English)
0 references
26 February 2007
0 references
combinatorial optimization
0 references
maximum tardiness
0 references
sequence-dependent setup
0 references
branch and bound
0 references
single machine schedule
0 references
0 references
0 references
0 references
