An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint (Q2390265): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with consecutive availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved heuristic for two-machine flowshop scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shops with limited machine availability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with limited machine availability / rank
 
Normal rank

Latest revision as of 19:01, 1 July 2024

scientific article
Language Label Description Also known as
English
An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
scientific article

    Statements

    Identifiers