A variable neighbourhood search algorithm for the flexible job-shop scheduling problem

DOI10.1080/00207540903055743zbMath1197.90191OpenAlexW2144821292MaRDI QIDQ3163164

No author found.

Publication date: 25 October 2010

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

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

zbMATH Keywords

makespancombinatorial optimisationvariable neighbourhood searchflexible job-shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (15)

A priority-based genetic algorithm for a flexible job shop scheduling problem ⋮ Online optimization of casualty processing in major incident response: an experimental analysis ⋮ Variable neighborhood search for the second type of two-sided assembly line balancing problem ⋮ A modified biogeography-based optimization for the flexible job shop scheduling problem ⋮ An integrated approach for scheduling health care activities in a hospital ⋮ A study on open shop scheduling to minimise total tardiness ⋮ Variable neighborhood search: basics and variants ⋮ An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems ⋮ Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs ⋮ A flexible job shop scheduling approach with operators for coal export terminals ⋮ Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics ⋮ Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net ⋮ Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm ⋮ A research survey: review of flexible job shop scheduling techniques ⋮ A multi-objective combinatorial model of casualty processing in major incident response

Uses Software

• J-MEANS

Cites Work

• Job-shop scheduling with multi-purpose machines
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• Variable neighborhood search
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• A variable neighborhood search for graph coloring.
• Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
• Effective neighbourhood functions for the flexible job shop problem
• Routing and scheduling in a flexible job shop by tabu search
• Variable neighborhood search and local branching
• A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem
• The Complexity of Flowshop and Jobshop Scheduling
• Variable neighborhood search for the p-median
• Parallel variable neighbourhood search algorithms for job shop scheduling problems
• Flexible job-shop scheduling problem under resource constraints
• Variable neighborhood search: Principles and applications
• J-MEANS: A new local search heuristic for minimum sum of squares clustering

This page was built for publication: A variable neighbourhood search algorithm for the flexible job-shop scheduling problem