The Time Dependent Machine Makespan Problem Is Strongly Np-Complete
Saved in:
Main Authors: | Cheng, T. C. E., DING, Qing |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
1999
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/874 https://doi.org/10.1016/s0305-0548(98)00093-8 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Minimizing the Makespan for Unrelated Parallel Machines
by: GUO, Yunsong, et al.
Published: (2007) -
An optical fiber network oracle for NP-complete problems
by: Shum, Perry Ping, et al.
Published: (2015) -
Quantum superiority for verifying NP-complete problems with linear optics
by: Arrazola, J.M., et al.
Published: (2021) -
Minimizing Makespan of Stochastic Customer Orders in Cellular Manufacturing Systems with Parallel Machines
by: Wu, Lang, et al.
Published: (2020) -
Scheduling Start Time Dependent Tasks with Deadlines and Identical Initial Processing Times on a Single Machine
by: Cheng, T. C. E., et al.
Published: (2003)