The complexity of two group scheduling problems (Q1860372): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity / 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: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of late jobs under the group technology assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling with Batch Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of scheduling job families about a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine shop scheduling problems with batch processing / rank
 
Normal rank

Latest revision as of 13:05, 5 June 2024

scientific article
Language Label Description Also known as
English
The complexity of two group scheduling problems
scientific article

    Statements