Branch-And-Bound Algorithms for Minimizing Total Earliness and Tardiness in a Two-Machine Permutation Flow Shop with Unforced Idle Allowed

AuthID
 P-00Q-GGZ
2
Author(s)
Schaller, J
·
Tipo de Documento
Article
Year published
2019
Publicado
in COMPUTERS & OPERATIONS RESEARCH, ISSN: 0305-0548
Volume: 109, Páginas: 1-11 (11)
Indexing
Wos®
Scopus®
Crossref®14
Google Scholar®
Publication Identifiers
SCOPUS: 2-s2.0-85064910812
Wos: WOS:000472124500001
Source Identifiers
ISSN: 0305-0548
Export Publication Metadata
Lista Marked
 Adicionar à lista Marked
Info
At this moment we don't have any links to full text documens.

Um espaço para investigadores e suas Instituições

Links Úteis

Ajuda

© 2024 CRACS & Inesc TEC - All Rights Reserved Política de Privacidade | Terms of Service