Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection (Q2215189): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/s10951-020-00657-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3035140752 / 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: Scheduling a batching machine / 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: A constraint generation approach for two-machine shop problems with jobs selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3391608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a single machine with parallel batching to minimize makespan and total rejection cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for single machine scheduling with release dates and rejections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / 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: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / 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: Bounded single-machine parallel-batch scheduling with release dates and rejection / 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: Bicriteria order acceptance and scheduling with consideration of fill rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for single machine scheduling with release dates and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / 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: A survey on offline scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with release dates and rejection / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:01, 24 July 2024

scientific article
Language Label Description Also known as
English
Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
scientific article

    Statements

    Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection (English)
    0 references
    0 references
    11 December 2020
    0 references
    scheduling
    0 references
    batch processing
    0 references
    job rejection
    0 references
    approximation algorithm
    0 references
    performance analysis
    0 references
    0 references
    0 references

    Identifiers