A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (Q497951): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ins.2013.07.026 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.INS.2013.07.026 / rank | |||
Normal rank | |||
Revision as of 02:51, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects |
scientific article |
Statements
A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (English)
0 references
25 September 2015
0 references
scheduling
0 references
single-machine
0 references
tardiness
0 references
learning effect
0 references
0 references
0 references
0 references
0 references
0 references
