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

Abstrato

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.

Isenção de responsabilidade: Este resumo foi traduzido usando ferramentas de inteligência artificial e ainda não foi revisado ou verificado

Resumido/Indexado em

Genamics JournalSeek
Infraestrutura Nacional de Conhecimento da China (CNKI)
CiteFactor
Biblioteca de periódicos eletrônicos
Diretório de Indexação de Periódicos de Pesquisa (DRJI)
OCLC- WorldCat
Invocação Proquest
publons
Fundação de Genebra para Educação e Pesquisa Médica
Euro Pub
Google Scholar
Laboratórios secretos do mecanismo de pesquisa
Catálogo da União de Séries (SUNCAT)

Avanços na Pesquisa em Ciências Aplicadas Acesso livre

Abstrato

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

Resumido/Indexado em

Links Úteis

Compartilhe esta página

Periódicos de Acesso Aberto