The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs (Q4632193): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Determination of common due window location in a single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common due window size and location determination in a single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded batch scheduling with a common due window on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient scheduling algorithms for a single batch processing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with agreeable release times and due dates on a batch processing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization on single batch-processing machine via ant colony optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a single batch processing machine with non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for semiconductor burn-in scheduling / rank
 
Normal rank

Latest revision as of 01:26, 19 July 2024

scientific article; zbMATH DE number 7048091
Language Label Description Also known as
English
The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs
scientific article; zbMATH DE number 7048091

    Statements

    Identifiers