Bi-criteria scheduling on a single parallel-batch machine (Q437901): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling an unbounded batch machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for single-machine problems with positive finish-start time-lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine parallel batch scheduling subject to precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of single machine, multi-criteria scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple and bicriteria scheduling: A literature survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of bi-criteria scheduling on a single batch processing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine unbounded parallel-batch scheduling with forbidden intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? / rank
 
Normal rank

Latest revision as of 12:24, 5 July 2024

scientific article
Language Label Description Also known as
English
Bi-criteria scheduling on a single parallel-batch machine
scientific article

    Statements

    Bi-criteria scheduling on a single parallel-batch machine (English)
    0 references
    0 references
    0 references
    0 references
    20 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    bi-criteria scheduling
    0 references
    complexity
    0 references
    Pareto-optimal solution
    0 references
    fully polynomial-time approximation scheme
    0 references
    0 references