A matheuristic approach for the two-machine total completion time flow shop problem (Q744632): Difference between revisions

@@ Property / cites work @@
+The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
+Normal rank
@@ Property / cites work @@
+An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
+Normal rank
@@ Property / cites work @@
+Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+A matheuristic approach for the two-machine total completion time flow shop problem
+Normal rank
@@ Property / cites work @@
+The two-machine total completion time flow shop problem
+Normal rank
@@ Property / cites work @@
+A variable neighborhood search based matheuristic for nurse rostering problems
+Normal rank
@@ Property / cites work @@
+An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
+Normal rank
@@ Property / cites work @@
+Local branching
@@ Property / cites work: Local branching / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search: Principles and applications
+Normal rank
@@ Property / cites work @@
+Lower bounds for minimizing total completion time in a two-machine flow shop
+Normal rank
@@ Property / cites work @@
+Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
+Normal rank
@@ Property / cites work @@
+A comprehensive review and evaluation of permutation flowshop heuristics
+Normal rank
@@ Property / cites work @@
+On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
+Normal rank
@@ Property / cites work @@
+Some efficient heuristic methods for the flow shop sequencing problem
+Normal rank
@@ Property / cites work @@
+Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
+Normal rank