Some efficient heuristic methods for the flow shop sequencing problem
From MaRDI portal
Publication:915635
DOI10.1016/0377-2217(90)90090-XzbMath0702.90043OpenAlexW2125827607MaRDI QIDQ915635
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(90)90090-x
Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)
Related Items
Benchmarks for basic scheduling problems, A user's guide to tabu search, A tabu-search heuristic for the flexible-resource flow shop scheduling problem, Iterative beam search algorithms for the permutation flowshop, An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times, Experimental comparison of heuristics for flow shop scheduling, Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling, Solving permutation flow shop scheduling problem with sequence-independent setup time, Parallel local search, Accelerating the calculation of makespan used in scheduling improvement heuristics, \(N\)-NEH+ algorithm for solving permutation flow shop problems, New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems, Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion, Local search methods for the flowshop scheduling problem with flowtime minimization, Assembly flowshop scheduling problem: speed-up procedure and computational evaluation, A cutoff time strategy based on the coupon collector's problem, Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II, Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem, Stochastic local search and parameters recommendation: a case study on flowshop problems, Partial neighborhood local searches, Research on m‐machine flow shop scheduling with truncated learning effects, Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem, The seeds of the NEH algorithm: an overview using bibliometric analysis, A branch-and-bound approach to the no-idle flowshop scheduling problem, A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities, A Lagrangean relaxation approach for the mixed-model flow line sequencing problem, Minimizing makespan on an \(m\)-machine re-entrant flowshop, Evaluating parallel simulated evolution strategies for VLSI cell placement, An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives, The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem, Two-stage hybrid flow shop with recirculation, 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, An effective new heuristic algorithm for solving permutation flow shop scheduling problem, Scheduling blocking flowshops with setup times via constraint guided and accelerated local search, A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion, 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 computational study with a new algorithm for the three-machine permutation flow-shop problem with release times, Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling, A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains, Tabu search for a class of single-machine scheduling problems, Hierarchical minimization of completion time variance and makespan in jobshops, An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers, Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem, Flow shop-sequencing problem with synchronous transfers and makespan minimization, Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs, Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling, Scheduling production tasks in a two-stage FMS, Flowshop-scheduling problems with makespan criterion: a review, Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem, Mixed integer linear programming models for flow shop scheduling with a demand plan of job types, An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop, Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues, Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning, Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem, A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective, Some aspects of scatter search in the flow-shop problem, Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach, Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time, A note on worst-case analysis of approximation algorithms for a scheduling problem, Combinatorial optimization techniques for spacecraft scheduling automation, Constraint guided accelerated search for mixed blocking permutation flowshop scheduling, A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, A neuro-tabu search heuristic for the flow shop scheduling problem, Makespan distribution of permutation flowshop schedules, A scatter search algorithm for the distributed permutation flowshop scheduling problem, Unrelated parallel machine scheduling using local search, 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, An effective differential evolution algorithm for permutation flow shop scheduling problem, The three-machine flow-shop problem with arbitrary precedence relations, Trade-off balancing in scheduling for flow shop production and perioperative processes, A genetic algorithm for flowshop sequencing, Genetic algorithms and tabu search: Hybrids for optimization, Flow-shop scheduling with flexible processors, Job-shop production scheduling with reverse flows, A real-time order acceptance and scheduling approach for permutation flow shop problems, Carbon-efficient scheduling of flow shops by multi-objective optimization, Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption, A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem, Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms, 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, On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem, A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion, A new set of high-performing heuristics to minimise flowtime in permutation flowshops, NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness, A discrete inter-species cuckoo search for flowshop scheduling problems, Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion, An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem, An effective heuristic algorithm for the partial shop scheduling problem, A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime, Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness, A generalized constructive algorithm using insertion-based heuristics, Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops, Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness, Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints, A comparison of neighborhood search techniques for multi-objective combinatorial problems, A comparison of local search methods for flow shop scheduling, Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines, Two-machine flow shop problems with a single server, Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge, Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem, Modified simulated annealing algorithms for the flow shop sequencing problem, A heuristic algorithm for mean flowtime objective in flowshop scheduling, Heuristic procedures for minimizing makespan and the number of required pallets, A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems, Hybrid flow-shop scheduling problems with multiprocessor task systems., Flow shop scheduling problem with conflict graphs, Improved genetic algorithm for the permutation flowshop scheduling problem., Case study on statistically estimating minimum makespan for flow line scheduling problems., An improved NEH-based heuristic for the permutation flowshop problem, Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems, An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers, A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers, A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation, Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion, Restricted neighborhood in the tabu search for the flowshop problem, An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times, Parallel hybrid heuristics for the permutation flow shop problem, An improved particle swarm optimization algorithm for flowshop scheduling problem, Setting a common due date in a constrained flowshop: a variable neighbourhood search approach, Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion, A comprehensive review and evaluation of permutation flowshop heuristics, Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics, Fast heuristics for minimizing the makespan in non-permutation flow shops, A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion, Heuristics for scheduling in a flow shop with multiple processors, A matheuristic approach for the two-machine total completion time flow shop problem, Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics, An SA/TS mixture algorithm for the scheduling tardiness problem, The job shop scheduling problem: Conventional and new solution techniques, The generalized shifting bottleneck procedure, Heuristics for permutation flow shop scheduling with batch setup times, A hybrid genetic local search algorithm for the permutation flowshop scheduling problem, An empirical analysis of the optimality rate of flow shop heuristics, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, A fast tabu search algorithm for the permutation flow-shop problem, Sevast'yanov's algorithm for the flow-shop scheduling problem, An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs, A tabu search Hooke and Jeeves algorithm for unconstrained optimization, Fuzzy sets and operations research: Perspectives, A two-machine permutation flow shop scheduling problem with buffers, A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems, The distributed permutation flowshop scheduling problem, Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization, A new constructive heuristic for the flowshop scheduling problem, Sequencing of jobs in some production system, Some results of the worst-case analysis for flow shop scheduling, A tabu search approach for the flow shop scheduling problem, Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation, Heuristics for the flow line problem with setup costs, A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size, Constructing a fuzzy flow-shop sequencing model based on statistical data, The flow shop with parallel machines: A tabu search approach, Performance enhancements to tabu search for the early/tardy scheduling problem, Handling flexibility in a ``generalised job shop with a fuzzy approach, Scheduling flow shops using differential evolution algorithm
Cites Work
