Positive half-products and scheduling with controllable processing times (Q1772845): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Minimization of Half-Products / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for minclique scheduling problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2712370 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New results on the completion time variance minimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimization of ordered, symmetric half-products / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. / rank | |||
Normal rank |
Revision as of 09:23, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Positive half-products and scheduling with controllable processing times |
scientific article |
Statements
Positive half-products and scheduling with controllable processing times (English)
0 references
21 April 2005
0 references
Single machine scheduling
0 references
Controllable processing times
0 references
Pseudo-Boolean optimization
0 references
Fully polynomial time approximation scheme
0 references
Computational complexity
0 references
0 references