Some results of the worst-case analysis for flow shop scheduling
From MaRDI portal
Publication:1296692
Recommendations
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
- Some results of the worst-case analysis for flow shop scheduling with a learning effect
- A worst-case analysis of the three-machine flow shop scheduling
- Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- Optimal results and numerical simulations for flow shop scheduling problems
- Approximability of flow shop scheduling
- The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
Cites work
- scientific article; zbMATH DE number 3825546 (Why is no real title available?)
- A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Note on Heuristics of Flow-Shop Scheduling
- A fast tabu search algorithm for the permutation flow-shop problem
- A genetic algorithm for flowshop sequencing
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- A new heuristic for the n-job, M-machine flow-shop problem
- A new heuristic method for the flow shop sequencing problem
- A note on worst-case analysis of approximation algorithms for a scheduling problem
- AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
- ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
- An Evaluation of Flow Shop Sequencing Heuristics
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Benchmarks for basic scheduling problems
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Flowshop sequencing with mean flowtime objective
- Heuristic-Programming Solution of a Flowshop-Scheduling Problem
- Heuristics for scheduling in flowshop with multiple objectives
- Minimizing total completion time in a two-machine flowshop: Analysis of special cases
- Modified simulated annealing algorithms for the flow shop sequencing problem
- New results in the worst-case analysis for flow-shop scheduling
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- On the heuristic solution of the permutation flow shop problem by path algorithms
- Restricted neighborhood in the tabu search for the flowshop problem
- Some efficient heuristic methods for the flow shop sequencing problem
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
Cited in
(32)- Performance guarantees for flowshop heuristics to minimize makespan
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- Flowshop scheduling research after five decades
- A note on weighted completion time minimization in a flexible flow shop
- Experimental comparison of heuristics for flow shop scheduling
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
- A linear time approximation algorithm for permutation flow shop scheduling
- Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- A new lower bounding rule for permutation flow shop scheduling
- A modification to the CGPS algorithm for three-machine flow shop scheduling
- scientific article; zbMATH DE number 1998822 (Why is no real title available?)
- Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion
- A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
- An empirical analysis of the optimality rate of flow shop heuristics
- Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- A note on worst-case analysis of approximation algorithms for a scheduling problem
- A computational study of the permutation flow shop problem based on a tight lower bound
- Exact exponential algorithms for 3-machine flowshop scheduling problems
- Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem
- A worst-case analysis of the three-machine flow shop scheduling
- Several flow shop scheduling problems with truncated position-based learning effect
- Research on permutation flow shop scheduling problems with general position-dependent learning effects
- Some results of the worst-case analysis for flow shop scheduling with a learning effect
- Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects
- Flowshop scheduling with a general exponential learning effect
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
- Flowshop scheduling problems with a position-dependent exponential learning effect
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
This page was built for publication: Some results of the worst-case analysis for flow shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296692)
