Single-machine batch scheduling of linear deteriorating jobs (Q2344768): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.tcs.2015.02.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036675142 / rank
 
Normal rank
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: Machine scheduling with job delivery coordination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch Delivery Scheduling on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with batch deliveries / 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: An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan / 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: Parallel-machine scheduling of simple linear deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan / 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: 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: Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric problem in scheduling theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logistics scheduling model: Inventory cost reduction by batching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online batch scheduling on parallel machines with delivery times / rank
 
Normal rank

Latest revision as of 02:53, 10 July 2024

scientific article
Language Label Description Also known as
English
Single-machine batch scheduling of linear deteriorating jobs
scientific article

    Statements

    Single-machine batch scheduling of linear deteriorating jobs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 May 2015
    0 references
    0 references
    scheduling
    0 references
    deteriorating jobs
    0 references
    batch
    0 references
    NP-hardness
    0 references
    FPTAS
    0 references
    non-approximability
    0 references
    0 references
    0 references