Complexity results for flow-shop problems with a single server (Q1772843): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling equal-length jobs on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for parallel machine problems with a single server / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-operator-two-machine flowshop scheduling with setup and dismounting times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling for parallel dedicated machines with a single server / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with a common server / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling problems with a single server / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for parallel machine scheduling with a common server / rank
 
Normal rank

Latest revision as of 10:23, 10 June 2024

scientific article
Language Label Description Also known as
English
Complexity results for flow-shop problems with a single server
scientific article

    Statements

    Identifiers