A new heuristic method for the flow shop sequencing problem
From MaRDI portal
Publication:1119464
DOI10.1016/0377-2217(89)90383-4zbMath0671.90040OpenAlexW1971769204MaRDI QIDQ1119464
Publication date: 1989
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(89)90383-4
Programming involving graphs or networks (90C35) Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Benchmarks for basic scheduling problems, A tabu search experience in production scheduling, Routing and scheduling in a flexible job shop by tabu search, A tabu search procedure for multicommodity location/allocation with balancing requirements, Solving the maximum clique problem using a tabu search approach, 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, 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, Genetic algorithms and tabu search: Hybrids for optimization, The tabu search metaheuristic: How we used it, Experimental comparison of heuristics for flow shop scheduling, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, A comparison of neighborhood search techniques for multi-objective combinatorial problems, On a scheduling problem in a robotized analytical system, An improved tabu search approach for solving the job shop scheduling problem with tooling constraints, A comparison of local search methods for flow shop scheduling, Metaheuristics: A bibliography, Two-machine flow shop problems with a single server, Considering scheduling and preventive maintenance in the flowshop sequencing problem, Modified simulated annealing algorithms for the flow shop sequencing problem, Heuristics for scheduling in flowshop with multiple objectives, Heuristic procedures for minimizing makespan and the number of required pallets, On the resources allocation problem, Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times., Multipath adaptive tabu search for a vehicle control problem, Some efficient heuristic methods for the flow shop sequencing problem, Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs., An ant colony system for permutation flow-shop sequencing, A Lagrangean relaxation approach for the mixed-model flow line sequencing problem, Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics, Finding a feasible course schedule using Tabu search, A bicriteria flowshop scheduling with a learning effect, Two-stage hybrid flow shop with recirculation, Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem, Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, On the heuristic solution of the permutation flow shop problem by path algorithms, Restricted neighborhood in the tabu search for the flowshop problem, Flowshop scheduling problem with parallel semi-lines and final synchronization operation, Scheduling of multiple in-line steppers for semiconductor wafer fabs, A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria, A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs, A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling, An improved particle swarm optimization algorithm for flowshop scheduling problem, Scheduling in flowshops to minimize total tardiness of jobs, Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study, A comprehensive review and evaluation of permutation flowshop heuristics, Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics, Flow shop-sequencing problem with synchronous transfers and makespan minimization, Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup, Flowshop-scheduling problems with makespan criterion: a review, Two branch and bound algorithms for the permutation flow shop problem, A simple tabu search method to solve the mixed-integer linear bilevel programming problem, The job shop scheduling problem: Conventional and new solution techniques, Heuristics for permutation flow shop scheduling with batch setup times, 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, 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, Forward Backward Transformation, Fuzzy sets and operations research: Perspectives, A new constructive heuristic for the flowshop scheduling problem, A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs, Scheduling a flowline manufacturing cell with sequence dependent family setup times, 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, Some aspects of scatter search in the flow-shop problem, A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, A review of TSP based approaches for flowshop scheduling, Heuristics for the flow line problem with setup costs, Deterministic job-shop scheduling problems with capacity focus, 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, Performance enhancements to tabu search for the early/tardy scheduling problem, The hot strip mill production scheduling problem: A tabu search approach, Scheduling flow shops using differential evolution algorithm
Cites Work
