scientific article
From MaRDI portal
Publication:3414902
zbMath1222.90014MaRDI QIDQ3414902
Publication date: 12 January 2007
Full work available at URL: http://en.cnki.com.cn/Article_en/CJFDTotal-TJDZ200605022.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (2)
The third comprehensive survey on scheduling problems with setup times/costs ⋮ Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times
This page was built for publication: