New results in the worst-case analysis for flow-shop scheduling (Q689950): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evaluation of Flow Shop Sequencing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness / 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: Worst-case analysis of an approximation algorithm for flow-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138949 / rank
 
Normal rank

Latest revision as of 10:45, 22 May 2024