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

Abstrakt

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.

Haftungsausschluss: Dieser Abstract wurde mit Hilfe von Künstlicher Intelligenz übersetzt und wurde noch nicht überprüft oder verifiziert

Abstrahiert/indiziert in

Genamics JournalSeek
Nationale Wissensinfrastruktur Chinas (CNKI)
CiteFactor
Elektronische Zeitschriftenbibliothek
Verzeichnis der Indexierung von Forschungszeitschriften (DRJI)
OCLC – WorldCat
Proquest-Vorladungen
Publons
Genfer Stiftung für medizinische Ausbildung und Forschung
Euro-Pub
Google Scholar
Geheime Suchmaschinenlabore
Zeitschriften-Verbundkatalog (SUNCAT)

Fortschritte in der angewandten Wissenschaftsforschung Offener Zugang

Abstrakt

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

Abstrahiert/indiziert in

Nützliche Links

Teile diese Seite

Open-Access-Zeitschriften