Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan (Q1038382): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The complexity of one-machine batching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling problems with setup times or costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling of step deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with time dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of scheduling with time-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch sizing and job sequencing on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-machine scheduling with simple linear deterioration to minimize total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling linear deteriorating jobs with an availability constraint on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch delivery scheduling with batch delivery cost on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs under simple linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Machine Scheduling With Linear Deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine / rank
 
Normal rank

Revision as of 04:18, 2 July 2024

scientific article
Language Label Description Also known as
English
Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
scientific article

    Statements

    Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan (English)
    0 references
    0 references
    0 references
    17 November 2009
    0 references
    batch scheduling
    0 references
    makespan
    0 references
    computational complexity
    0 references
    FPTAS
    0 references
    0 references
    0 references

    Identifiers