A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties (Q2285347)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties |
scientific article; zbMATH DE number 7148921
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties |
scientific article; zbMATH DE number 7148921 |
Statements
A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties (English)
0 references
8 January 2020
0 references
minimization of earliness and tardiness
0 references
group scheduling
0 references
sequence-dependent setup time
0 references
time-indexed formulation
0 references
Lagrangian relaxation
0 references
branch-and-bound algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8591941595077515
0 references
0.8484550714492798
0 references
0.8458463549613953
0 references
0.8436272144317627
0 references
