NP-hardness of compact scheduling in simplified open and flow shops - Publication - Bridge of Knowledge

Search

NP-hardness of compact scheduling in simplified open and flow shops

Abstract

Citations

  • 2 5

    CrossRef

  • 0

    Web of Science

  • 2 6

    Scopus

Author (1)

Cite as

Full text

full text is not available in portal

Details

Category:
Magazine publication
Type:
Magazine publication
Published in:
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH no. 130, edition 1, pages 90 - 98,
ISSN: 0377-2217
ISSN:
0377-2217
Publication year:
2001
DOI:
Digital Object Identifier (open in new tab) 10.1016/s0377-2217(00)00022-9
Verified by:
No verification

seen 66 times

Meta Tags