Results 311 to 320 of about 737,186 (350)
Some of the next articles are maybe not open access.

General flow-shop and job-shop problems

1976
In 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

Job Shop

1994
V. S. Tanaev   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy