Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2015.10.021 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.10.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2193919580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3378953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on offline scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling one batch processor subject to job release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling an unbounded batch machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with release dates and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling under the job rejection constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded single-machine parallel-batch scheduling with release dates and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for parallel batch scheduling with rejection and dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost / 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: Q3988807 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2015.10.021 / rank
 
Normal rank

Latest revision as of 12:55, 9 December 2024

scientific article
Language Label Description Also known as
English
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
scientific article

    Statements

    Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 April 2016
    0 references
    batching machine scheduling
    0 references
    rejection
    0 references
    makespan
    0 references
    dynamic programming
    0 references
    FPTAS
    0 references
    approximation algorithms
    0 references

    Identifiers