Positive half-products and scheduling with controllable processing times (Q1772845): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1575602
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Wiesław X. Kubiak / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978857382 / rank
 
Normal rank
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

Latest revision as of 10: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
    0 references
    0 references
    0 references
    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

    Identifiers