An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C57 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6066826 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
single machine | |||
| Property / zbMATH Keywords: single machine / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
bottleneck decomposition | |||
| Property / zbMATH Keywords: bottleneck decomposition / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
subproblem solution | |||
| Property / zbMATH Keywords: subproblem solution / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
branch and bound | |||
| Property / zbMATH Keywords: branch and bound / rank | |||
Normal rank | |||
Revision as of 00:44, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective |
scientific article |
Statements
An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (English)
0 references
16 August 2012
0 references
scheduling
0 references
single machine
0 references
bottleneck decomposition
0 references
subproblem solution
0 references
branch and bound
0 references
