Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2008.06.004 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2008.06.004 / rank | |||
Normal rank | |||
Latest revision as of 12:45, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing lower and upper bounds for a large-scale industrial job shop scheduling problem |
scientific article |
Statements
Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (English)
0 references
8 April 2009
0 references
scheduling
0 references
batching
0 references
tabu search
0 references
mathematical programming
0 references
0 references
0 references
0 references
