Branch and bound technique to two stage flow shop scheduling problem in
which setup time is separated from processing time and both are associated
with probabilities including job block criteria

Deepak Gupta; Harminder Singh

抽象的な

Branch and bound technique to two stage flow shop scheduling problem in which setup time is separated from processing time and both are associated with probabilities including job block criteria

Deepak Gupta and Harminder Singh

This paper presents an algorithm with the help of branch and bound approach for a flowshop scheduling problems consisting of n jobs to be processed on 2 machines in which setup time is separated from processing time and both are associated with probabilities including job block criteria.

免責事項: この要約は人工知能ツールを使用して翻訳されており、まだレビューまたは確認されていません

応用科学研究の進歩オープンアクセス

抽象的な

Branch and bound technique to two stage flow shop scheduling problem in which setup time is separated from processing time and both are associated with probabilities including job block criteria

抽象化/インデックス化

役立つリンク

このページをシェアする

オープンアクセスジャーナル

応用科学研究の進歩 オープンアクセス

抽象的な

Branch and bound technique to two stage flow shop scheduling problem in which setup time is separated from processing time and both are associated with probabilities including job block criteria

抽象化/インデックス化

役立つリンク

このページをシェアする

オープンアクセスジャーナル

応用科学研究の進歩オープンアクセス