An Evaluation of Flow Shop Sequencing Heuristics

DOI10.1287/MNSC.23.11.1174zbMath0371.90063OpenAlexW2149027038MaRDI QIDQ4147827

David G. Dannenbring

Publication date: 1977

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.23.11.1174

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items (only showing first 100 items - show all)

Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs ⋮ A note on worst-case analysis of approximation algorithms for a scheduling problem ⋮ A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling ⋮ A tabu-search heuristic for the flexible-resource flow shop scheduling problem ⋮ On the Modeling Tactics of Research Extensions in Production/Operations Management ⋮ An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal ⋮ Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines ⋮ A neuro-tabu search heuristic for the flow shop scheduling problem ⋮ A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem ⋮ The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems ⋮ On the combinatorial structure of the permutation flow shop problem ⋮ Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Job-shop production scheduling with reverse flows ⋮ On heuristic solutions for the stochastic flowshop scheduling problem ⋮ Experimental comparison of heuristics for flow shop scheduling ⋮ Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems ⋮ A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem ⋮ A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops ⋮ A new heuristic method for the flow shop sequencing problem ⋮ Worst-case analysis of an approximation algorithm for flow-shop scheduling ⋮ Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem ⋮ A discrete version of particle swarm optimization for flowshop scheduling problems ⋮ Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge ⋮ Flowshop sequencing problems with limited buffer storage ⋮ New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems ⋮ Considering scheduling and preventive maintenance in the flowshop sequencing problem ⋮ Modified simulated annealing algorithms for the flow shop sequencing problem ⋮ Flowshop sequencing with mean flowtime objective ⋮ Assembly flowshop scheduling problem: speed-up procedure and computational evaluation ⋮ Heuristics for scheduling in flowshop with multiple objectives ⋮ A heuristic algorithm for mean flowtime objective in flowshop scheduling ⋮ Total flowtime in no-wait flowshops with separated setup times. ⋮ A contribution to the stochastic flow shop scheduling problem. ⋮ The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem ⋮ New heuristics for no-wait flowshops to minimize makespan. ⋮ Some efficient heuristic methods for the flow shop sequencing problem ⋮ Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme ⋮ An improved NEH-based heuristic for the permutation flowshop problem ⋮ Flowshop scheduling problems with a position-dependent exponential learning effect ⋮ An ant colony system for permutation flow-shop sequencing ⋮ Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling ⋮ Two-stage hybrid flow shop with recirculation ⋮ An efficient heuristic approach to the scheduling of jobs in a flowshop ⋮ A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria ⋮ Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem ⋮ An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ New results in the worst-case analysis for flow-shop scheduling ⋮ On the heuristic solution of the permutation flow shop problem by path algorithms ⋮ Restricted neighborhood in the tabu search for the flowshop problem ⋮ An effective new heuristic algorithm for solving permutation flow shop scheduling problem ⋮ Parallel hybrid heuristics for the permutation flow shop problem ⋮ A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria ⋮ Comparison of heuristics for flowtime minimisation in permutation flowshops ⋮ A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs ⋮ A new heuristic and dominance relations for no-wait flowshops with setups ⋮ Design and scheduling of flexible assembly lines for printed circuit boards ⋮ Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems ⋮ Scheduling in flowshops to minimize total tardiness of jobs ⋮ A comprehensive review and evaluation of permutation flowshop heuristics ⋮ Scheduling experiments on a nulear reactor using mixed integer programming ⋮ A computational study of the permutation flow shop problem based on a tight lower bound ⋮ A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness ⋮ A new heuristic for the n-job, M-machine flow-shop problem ⋮ Elimination conditions and lower bounds for the permutation flow-shop sequencing problem ⋮ Scheduling algorithms for flexible flowshops: Worst and average case performance ⋮ Heuristics for scheduling in a flow shop with multiple processors ⋮ Scheduling production tasks in a two-stage FMS ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ An SA/TS mixture algorithm for the scheduling tardiness problem ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors ⋮ An improved branch and bound procedure for scheduling a flow line manufacturing cell ⋮ A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines ⋮ Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues ⋮ A hybrid genetic local search algorithm for the permutation flowshop scheduling problem ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ A fast tabu search algorithm for the permutation flow-shop problem ⋮ Sevast'yanov's algorithm for the flow-shop scheduling problem ⋮ Heuristic methods and applications: A categorized survey ⋮ An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs ⋮ Heuristic for scheduling in a Kanban system with dual blocking mechanisms ⋮ A new constructive heuristic for the flowshop scheduling problem ⋮ Scheduling a flowline manufacturing cell with sequence dependent family setup times ⋮ Some results of the worst-case analysis for flow shop scheduling ⋮ A tabu search approach for the flow shop scheduling problem ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints ⋮ Flexible flow shop scheduling with uniform parallel machines ⋮ Some aspects of scatter search in the flow-shop problem ⋮ Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation ⋮ Performance guarantees for flowshop heuristics to minimize makespan ⋮ Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems ⋮ Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 1 ⋮ A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size ⋮ Production scheduling with applications in the printing industry ⋮ Constructing a fuzzy flow-shop sequencing model based on statistical data ⋮ Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment ⋮ A comparative study of dispatching rules in dynamic flowshops and jobshops

This page was built for publication: An Evaluation of Flow Shop Sequencing Heuristics