Batch scheduling with deadlines on parallel machines: an NP-hard case (Q287238): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Batch scheduling with deadlines on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scientific school of Academician V. S. Tanaev: results on the scheduling theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00154-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006121311 / rank
 
Normal rank

Latest revision as of 10:34, 30 July 2024

scientific article
Language Label Description Also known as
English
Batch scheduling with deadlines on parallel machines: an NP-hard case
scientific article

    Statements

    Batch scheduling with deadlines on parallel machines: an NP-hard case (English)
    0 references
    0 references
    0 references
    26 May 2016
    0 references
    parallel machine scheduling
    0 references
    batching
    0 references
    computational complexity
    0 references

    Identifiers