A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
From MaRDI portal
Publication:4678194
DOI10.1057/palgrave.jors.2601784zbMath1088.90022OpenAlexW1985351347MaRDI QIDQ4678194
Rainer Leisten, Jose M. Framinan, Jatinder N. D. Gupta
Publication date: 23 May 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601784
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Makespan distribution of permutation flowshop schedules ⋮ A scatter search algorithm for the distributed permutation flowshop scheduling problem ⋮ Trade-off balancing in scheduling for flow shop production and perioperative processes ⋮ New hard benchmark for flowshop scheduling problems minimising makespan ⋮ On heuristic solutions for the stochastic flowshop scheduling problem ⋮ Flowshop scheduling with a general exponential learning effect ⋮ On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem ⋮ NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness ⋮ Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime ⋮ A generalized constructive algorithm using insertion-based heuristics ⋮ New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem ⋮ Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem ⋮ Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem ⋮ Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems ⋮ On some lower bounds for the permutation flowshop problem ⋮ Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem ⋮ Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem ⋮ A review and classification on distributed permutation flowshop scheduling problems ⋮ A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem ⋮ Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion ⋮ A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems ⋮ Bicriterion optimization for flow shop with a learning effect subject to release dates ⋮ Exact exponential algorithms for 3-machine flowshop scheduling problems ⋮ A note on the total completion time problem in a permutation flowshop with a learning effect ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness ⋮ An effective new heuristic algorithm for solving permutation flow shop scheduling problem ⋮ Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective ⋮ A three-phase algorithm for flowshop scheduling with blocking to minimize makespan ⋮ A self-guided genetic algorithm for permutation flowshop scheduling problems ⋮ Setting a common due date in a constrained flowshop: a variable neighbourhood search approach ⋮ An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production ⋮ Flow shop-sequencing problem with synchronous transfers and makespan minimization ⋮ Timed event graph-based cyclic reconfigurable flow shop modelling and optimization ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates ⋮ Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup ⋮ A mathematical model and two-stage heuristic for hot rolling scheduling in compact strip production ⋮ Machine scheduling in production: a content analysis ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics ⋮ EVALUATING PERFORMANCE OF FLOW LINE SYSTEMS WITH BLOCKING UNDER FUZZY ENVIRONMENTS ⋮ 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 ⋮ Heuristic for stochastic online flowshop problem with preemption penalties ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ The distributed permutation flowshop scheduling problem ⋮ Flowshop scheduling research after five decades ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Performance guarantees for flowshop heuristics to minimize makespan ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
