A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times (Q2572851): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2004.07.074 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2004.07.074 / rank | |||
Normal rank | |||
Latest revision as of 07:43, 19 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times |
scientific article |
Statements
A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times (English)
0 references
4 November 2005
0 references
Scheduling
0 references
Distributed database
0 references
Flowshop
0 references
Total completion time
0 references
Dominance relation
0 references
Lower and upper bounds
0 references
Branch-and-bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
