A General Bounding Scheme for the Permutation Flow-Shop Problem
From MaRDI portal
Cited in
(51)- A new integer programming formulation for the permutation flowshop problem
- Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
- Minimizing total tardiness in permutation flowshops
- An adaptive branching rule for the permutation flow-shop problem
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- Two branch and bound algorithms for the permutation flow shop problem
- The job shop scheduling problem: Conventional and new solution techniques
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
- A new node selection strategy in the branch-and-bound procedure
- Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
- Two-stage flowshop scheduling with a common second-stage machine
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
- Flow shop scheduling problem with conflict graphs
- Exact exponential algorithms for 3-machine flowshop scheduling problems
- A computational study of the permutation flow shop problem based on a tight lower bound
- Lot streaming in the two-machine flow shop with setup times
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
- Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems
- Competitive production scheduling: A two-firm, noncooperative finite dynamic game
- Application of an optimization problem in max-plus algebra to scheduling problems
- Flowshop scheduling research after five decades
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
- A new lower bounding rule for permutation flow shop scheduling
- Permutation flow shop scheduling with earliness and tardiness penalties
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- P2P B&B and GA for the Flow-Shop Scheduling Problem
- SEQUENCING CONTROL OF PHYSICO‐CHEMICAL PROCESSES
- General flow-shop scheduling with resource constraints
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion
- Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers
- Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan
- Generating improved dominance conditions for the flowshop problem
- Elimination conditions and lower bounds for the permutation flow-shop sequencing problem
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
- Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry
- A branch-and-bound approach to the no-idle flowshop scheduling problem
- A unified framework for population-based metaheuristics
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness
- On the heuristic solution of the permutation flow shop problem by path algorithms
- Scheduling preemptive open shops to minimize total tardiness
- Revisiting Johnson's rule for minimizing makespan in the two-machine flow shop scheduling problem
- Algorithms for two-machine flow-shop sequencing with precedence constraints
- Branch and bound algorithm for the flow shop with multiple processors
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems
- An exact parallel method for a bi-objective permutation flowshop problem
- A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
This page was built for publication: A General Bounding Scheme for the Permutation Flow-Shop Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4147823)
