Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times

DOI10.1080/00207540802556817zbMath1197.90195OpenAlexW1974067285MaRDI QIDQ3163716

J. Behnamian, Seyyed Mohammad Taghi Fatemi Ghomi, Mostafa Zandieh

Publication date: 26 October 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540802556817

zbMATH Keywords

simulated annealingsequence-dependent setup timesearliness and tardinesshybrid flowshopvariable neighbourhood searchant colony optimisation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ Optimizing of bullwhip effect and net stock amplification in three-echelon supply chains using evolutionary multi-objective metaheuristics ⋮ Bi-objective integrating sustainable order allocation and sustainable supply chain network strategic design with stochastic demand using a novel robust hybrid multi-objective metaheuristic ⋮ Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows ⋮ A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation ⋮ Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid ⋮ Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem

Cites Work

• Optimization by Simulated Annealing
• A survey of very large-scale neighborhood search techniques
• An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
• An SA/TS mixture algorithm for the scheduling tardiness problem
• Scheduling of flexible flow lines in an automobile assembly plant
• Branch and bound crossed with GA to solve hybrid flowshops
• Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
• Scheduling a two-stage hybrid flowshop with separable setup and removal times
• Variable neighborhood search
• Job shop scheduling with group-dependent setups, finite buffers, and long time horizon
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
• Scheduling flexible flow lines with sequence-dependent setup times
• A survey of scheduling problems with setup times or costs
• Sequencing with Earliness and Tardiness Penalties: A Review
• A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
• Bottleneck-focused scheduling for a hybrid flowshop
• A new simulated annealing algorithm
• Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
• Conceptual framework for lot-sizing and scheduling of flexible flow lines

This page was built for publication: Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times