A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem

DOI10.1016/S0377-2217(96)00083-5zbMath0917.90189MaRDI QIDQ1278537

Hironori Matsumoto, Jinliang Cheng, Hiroshi Kise

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundMonte Carlo simulationsmakespanfuzzy inferencedominance relation\(m\)-machine permutation flowshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (11)

Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. ⋮ Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems ⋮ Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem ⋮ A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem ⋮ Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion ⋮ Exact exponential algorithms for 3-machine flowshop scheduling problems ⋮ A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times ⋮ A computational study of the permutation flow shop problem based on a tight lower bound ⋮ Survey on fuzzy shop scheduling ⋮ USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS ⋮ The nonpermutation flowshop scheduling problem: adjustment and bounding procedures

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• The one-machine sequencing problem
• An algorithm and efficient data structures for the binary knapsack problem
• Benchmarks for basic scheduling problems
• Optimal two- and three-stage production schedules with setup times included
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Scheduling Parts in a Combined Production-transportation Work Cell
• Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
• The Lessons of Flowshop Scheduling Research
• ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
• A Comparative Study of Flow-Shop Algorithms
• An improved branch and bound procedure forn ×m flow shop problems
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• Johnson's approximate method for the 3 ×n job shop problem
• The Complexity of Flowshop and Jobshop Scheduling
• Mathematical aspects of the 3 × n job-shop sequencing problem
• Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
• Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines

This page was built for publication: A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem