Approximation schemes for parallel machine scheduling problems with controllable processing times (Q1885962): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: A survey of results for sequencing problems with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with discretely controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proportionate flow shop with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Multiple Variable-Speed Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank

Latest revision as of 14:14, 7 June 2024

scientific article
Language Label Description Also known as
English
Approximation schemes for parallel machine scheduling problems with controllable processing times
scientific article

    Statements

    Identifiers