References: The strong NP-completeness of 3-PARTITION problem with B⩾km

Views

CrossRef citations to date

Altmetric

References

BachmanAJaniakAScheduling jobs with position dependent processing timesJournal of the Operational Research Society200455325726410.1057/palgrave.jors.2601689
Web of Science ®Google Scholar
GareyMRJohnsonDSComputers and Intractability: A Guide to the Theory of NP-Completeness1979
Google Scholar
RudekRA note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing timesOptimization Letters2012651021102510.1007/s11590-011-0330-2
Web of Science ®Google Scholar

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

The strong NP-completeness of 3-PARTITION problem with B⩾k^m

References

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

The strong NP-completeness of 3-PARTITION problem with B⩾km

References

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date

The strong NP-completeness of 3-PARTITION problem with B⩾k^m