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

Abstracto

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.

Descargo de responsabilidad: este resumen se tradujo utilizando herramientas de inteligencia artificial y aún no ha sido revisado ni verificado

Resumido/Indizado en

Genamics JournalSeek
Infraestructura Nacional de Conocimiento de China (CNKI)
CiteFactor
Biblioteca de revistas electrónicas
Directorio de indexación de revistas de investigación (DRJI)
OCLC-WorldCat
Convocatoria de búsqueda
Publón
Fundación de Ginebra para la Educación e Investigación Médica
pub europeo
Google Académico
Laboratorios secretos de motores de búsqueda
Catálogo Colectivo de Publicaciones Seriadas (SUNCAT)

Avances en la investigación en ciencias aplicadas Acceso abierto

Abstracto

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/Indizado en

Enlaces útiles

Comparte esta página

Revistas de acceso abierto