Some results of the worst-case analysis for flow shop scheduling
From MaRDI portal
Publication:1296692
DOI10.1016/S0377-2217(97)00139-2zbMath0987.90043OpenAlexW2002124279WikidataQ126550683 ScholiaQ126550683MaRDI QIDQ1296692
Publication date: 2 August 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00139-2
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (24)
Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines ⋮ A worst-case analysis of the three-machine flow shop scheduling ⋮ Experimental comparison of heuristics for flow shop scheduling ⋮ An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion ⋮ Minimizing maximum completion time in a proportionate flow shop with one machine of different speed ⋮ Several flow shop scheduling problems with truncated position-based learning effect ⋮ Flowshop scheduling with a general exponential learning effect ⋮ A note on flow shop scheduling problems with a learning effect on no-idle dominant machines ⋮ Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent 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 ⋮ Flowshop scheduling problems with a position-dependent exponential learning effect ⋮ Exact exponential algorithms for 3-machine flowshop scheduling problems ⋮ A new lower bounding rule for permutation flow shop scheduling ⋮ A modification to the CGPS algorithm for three-machine flow shop scheduling ⋮ Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects ⋮ Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem ⋮ A computational study of the permutation flow shop problem based on a tight lower bound ⋮ A note on weighted completion time minimization in a flexible flow shop ⋮ Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects ⋮ Flowshop scheduling research after five decades ⋮ Performance guarantees for flowshop heuristics to minimize makespan
Cites Work
- Unnamed Item
- New results in the worst-case analysis for flow-shop scheduling
- On the heuristic solution of the permutation flow shop problem by path algorithms
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Some efficient heuristic methods for the flow shop sequencing problem
- A new heuristic method for the flow shop sequencing problem
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Flowshop sequencing with mean flowtime objective
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Restricted neighborhood in the tabu search for the flowshop problem
- A fast tabu search algorithm for the permutation flow-shop problem
- A note on worst-case analysis of approximation algorithms for a scheduling problem
- A genetic algorithm for flowshop sequencing
- Heuristics for scheduling in flowshop with multiple objectives
- A new heuristic for the n-job, M-machine flow-shop problem
- Benchmarks for basic scheduling problems
- Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
- A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
- Flowshop and Jobshop Schedules: Complexity and Approximation
- An Evaluation of Flow Shop Sequencing Heuristics
- AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- Heuristic-Programming Solution of a Flowshop-Scheduling Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- A Note on Heuristics of Flow-Shop Scheduling
This page was built for publication: Some results of the worst-case analysis for flow shop scheduling
