A new heuristic for the n-job, M-machine flow-shop problem

DOI10.1016/0377-2217(91)90080-FzbMath0725.90045OpenAlexW2019192981MaRDI QIDQ2277356

Publication date: 1991

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(91)90080-f

zbMATH Keywords

simulation production scheduling makespan heuristic mean flow time flow-shop scheduling machine sequencing mean utilization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A note on worst-case analysis of approximation algorithms for a scheduling problem, A neuro-tabu search heuristic for the flow shop scheduling problem, Solving multi-objective production scheduling problems using metaheuristics, An effective differential evolution algorithm for permutation flow shop scheduling problem, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem, A discrete inter-species cuckoo search for flowshop scheduling problems, A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime, Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem, Flowshop sequencing with mean flowtime objective, Heuristics for scheduling in flowshop with multiple objectives, A heuristic algorithm for mean flowtime objective in flowshop scheduling, Heuristic procedures for minimizing makespan and the number of required pallets, Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry, Case study on statistically estimating minimum makespan for flow line scheduling problems., A bicriteria flowshop scheduling with a learning effect, An efficient heuristic approach to the scheduling of jobs in a flowshop, An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion, An effective new heuristic algorithm for solving permutation flow shop scheduling problem, A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria, Flow shops with WIP and value added costs, A flexible flowshop problem with total flow time minimization, A comprehensive review and evaluation of permutation flowshop heuristics, Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem, A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness, Heuristics for scheduling in a flow shop with multiple processors, Flowshop-scheduling problems with makespan criterion: a review, 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, 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, Forward Backward Transformation, A new constructive heuristic for the flowshop scheduling problem, A robust two-machine flow-shop scheduling model with scenario-dependent processing times, 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, Constructing a fuzzy flow-shop sequencing model based on statistical data, The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime, Scheduling flow shops using differential evolution algorithm

Cites Work