scientific article; zbMATH DE number 2050744

MaRDI QIDQ4452938zbMATH OpenFDO

Authors Jinliang Cheng, George Steiner, Paul Stephenson, Hiroshi Kise

Publication date 7 March 2004

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Recommendations

• A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
• A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
• A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
• Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
• A computational study of the permutation flow shop problem based on a tight lower bound

Cited in

(7)

• A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
• A heuristic method for RCPSP with fuzzy activity times
• 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
• Solving constrained flow-shop scheduling problem through multistage fuzzy binding approach with fuzzy due dates
• A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
• A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment

This page was built for publication:

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