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

Abstrait

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.

Avertissement: test

Extrait/Indexé dans

Genamics JournalSeek
Infrastructure nationale des connaissances en Chine (CNKI)
CiteFactor
Bibliothèque des revues électroniques
Répertoire d'indexation des revues de recherche (DRJI)
OCLC - WorldCat
Invocation de Proquête
Publions
Fondation genevoise pour la formation et la recherche médicales
Pub européen
Google Scholar
Laboratoires secrets des moteurs de recherche
Catalogue collectif des publications en série (SUNCAT)

Progrès de la recherche en sciences appliquées Libre accès

Abstrait

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

Extrait/Indexé dans

Liens utiles

Partager cette page

Revues en libre accès