Results 271 to 280 of about 24,116 (312)
Some of the next articles are maybe not open access.
General flow-shop and job-shop problems
1976In this chapter we consider general flow-shop and job-shop problems for which the number m of machines is variable. All these problems can be proved to be NP-complete from results in previous chapters; consequently the algorithms discussed in this chapter are mainly of the branch-and-bound type.
openaire +1 more source
Adaptive scheduling for assembly job shop with uncertain assembly times based on dual Q-learning
International Journal of Production Research, 2021Bhaba R Sarker
exaly
A hybrid genetic tabu search algorithm for distributed flexible job shop scheduling problems
Journal of Manufacturing Systems, 2023Xin-Yu Li, Liang Gao, Lin Gui
exaly

