Old Web
English
Sign In
Acemap
>
Paper
>
A branch and bound algorithm for the job-shop scheduling problem
A branch and bound algorithm for the job-shop scheduling problem
1994
BruckerPeter
JurischBernd
SieversBernd
Keywords:
Branch and bound
branch and bound method
job shop scheduling problem
Job shop scheduling
Mathematics
Mathematical optimization
Discrete mathematics
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]