A Comparative Study of Flow-Shop Algorithms

Cited in

(18)

The job shop scheduling problem: Conventional and new solution techniques
A tabu-search heuristic for the flexible-resource flow shop scheduling problem
Elimination conditions and lower bounds for the permutation flow-shop sequencing problem
Minimization of the makespan in a two-machine problem under given resource constraints
Branch and bound algorithm for the flow shop with multiple processors
A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
A new lower bounding rule for permutation flow shop scheduling
A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems
Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions
A new integer programming formulation for the permutation flowshop problem
scientific article; zbMATH DE number 1437089 (Why is no real title available?)
Flow shop-sequencing problem with synchronous transfers and makespan minimization
A Lagrangean relaxation approach for the mixed-model flow line sequencing problem
Two-stage flowshop scheduling with a common second-stage machine
A heuristic algorithm to schedule work in the repair industry
The interface of buffer design and cyclic scheduling decisions in deterministic flow lines
An adaptive branching rule for the permutation flow-shop problem

This page was built for publication: A Comparative Study of Flow-Shop Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4065271)