A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times (Q1941204): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Scheduling jobs with position-dependent processing times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New results on the least common multiple of consecutive integers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3856819 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2743969 / rank | |||
Normal rank |
Latest revision as of 07:04, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times |
scientific article |
Statements
A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times (English)
0 references
12 March 2013
0 references
computational analysis
0 references
strong NP-hardness
0 references
scheduling
0 references
learning effect
0 references
position-dependent processing time
0 references