The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (Q924160): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Ling-Fa Lu / rank
Normal rank
 
Property / author
 
Property / author: Li-Qi Zhang / rank
Normal rank
 
Property / author
 
Property / author: Ling-Fa Lu / rank
 
Normal rank
Property / author
 
Property / author: Li-Qi Zhang / rank
 
Normal rank
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.2008.02.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012296215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching 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: Multiprocessor Scheduling with Rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of unit time jobs with rejection: Minimizing the total completion time / 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: Preemptive scheduling with rejection / 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: Minimizing makespan on a single batch processing machine with dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling an unbounded batch machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive multiprocessor scheduling with rejection / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:57, 28 June 2024

scientific article
Language Label Description Also known as
English
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
scientific article

    Statements

    The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (English)
    0 references
    0 references
    0 references
    0 references
    28 May 2008
    0 references
    0 references
    scheduling
    0 references
    rejection penalty
    0 references
    fully polynomial-time approximation scheme
    0 references
    0 references