The Time Dependent Machine Makespan Problem Is Strongly Np-Complete
Publication Type
Journal Article
Publication Date
1999
Discipline
Business
Research Areas
Operations Management
Publication
Computers and Operations Research
Volume
26
Issue
8
First Page
749
Last Page
754
ISSN
0305-0548
Identifier
10.1016/s0305-0548(98)00093-8
Publisher
Elsevier
Citation
Cheng, T. C. E. and DING, Qing.
The Time Dependent Machine Makespan Problem Is Strongly Np-Complete. (1999). Computers and Operations Research. 26, (8), 749-754.
Available at: https://ink.library.smu.edu.sg/lkcsb_research/874