Pages that link to "Item:Q1876196"
From MaRDI portal
The following pages link to The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm (Q1876196):
Displaying 34 items.
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (Q322969) (← links)
- An assignment-based lower bound for a class of two-machine flow shop problems (Q336351) (← links)
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop (Q582206) (← links)
- Mathematical model for cyclic scheduling with work-in-process minimization (Q656064) (← links)
- A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
- Algorithms for two-machine flow-shop sequencing with precedence constraints (Q800822) (← links)
- Branch and bound algorithm for the flow shop with multiple processors (Q809880) (← links)
- Lower bounds for minimizing total completion time in a two-machine flow shop (Q880570) (← links)
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation (Q922280) (← links)
- A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
- Minimizing the sum of job completion times on capacitated two-parallel machines (Q1014943) (← links)
- The two-machine total completion time flow shop problem (Q1266536) (← links)
- Time complexity and linear-time approximation of the ancient two-machine flow shop (Q1268836) (← links)
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. (Q1406627) (← links)
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (Q1604072) (← links)
- A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
- A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem (Q1869904) (← links)
- Two-machine flowshop scheduling with a secondary criterion (Q1870802) (← links)
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207) (← links)
- A global constraint for total weighted completion time for unary resources (Q2430362) (← links)
- The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time (Q2475853) (← links)
- A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times (Q2572851) (← links)
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761) (← links)
- A new lower bounding rule for permutation flow shop scheduling (Q2766112) (← links)
- Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times (Q2861538) (← links)
- A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS (Q3573666) (← links)
- A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints (Q3636717) (← links)
- The permutation flow shop problem with sum-of-completion times performance criterion (Q4279265) (← links)
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop (Q4717402) (← links)
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem (Q4849290) (← links)
- A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP (Q5708850) (← links)
- Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date (Q5939594) (← links)
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates (Q6066663) (← links)
- An intensification approach based on fitness landscape characteristics for job shop scheduling problem (Q6645165) (← links)
