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
·
Document Type
Article
Year published
2019
Published
in COMPUTERS & OPERATIONS RESEARCH, ISSN: 0305-0548
Volume: 109, Pages: 1-11 (11)
Indexing
Wos®
Scopus®
Crossref®12
Google Scholar®
Publication Identifiers
Scopus: 2-s2.0-85064910812
Wos: WOS:000472124500001
Source Identifiers
ISSN: 0305-0548
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service