Heuristic approaches for scheduling jobs in large-scale flexible job shops

DOI10.1016/j.cor.2015.11.004zbMath1349.90399OpenAlexW2227399030MaRDI QIDQ342300

Lars Mönch, Oleh Sobeyko

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.11.004

zbMATH Keywords

schedulinglocal searchbenchmark instancestotal weighted tardinessflexible job shopsshifting bottleneck heuristic

Mathematics Subject Classification ID

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

Related Items (3)

A survey of job shop scheduling problem: the types and models ⋮ A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems ⋮ A batch-oblivious approach for complex job-shop scheduling problems

Cites Work

• Unnamed Item
• A general approach for optimizing regular criteria in the job-shop scheduling problem
• A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
• Maintaining longest paths incrementally
• Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
• An effective architecture for learning and evolving flexible job-shop schedules
• Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
• Job-shop scheduling with multi-purpose machines
• Extending the shifting bottleneck procedure to real-life applications
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• Heuristics for minimizing total weighted tardiness in flexible flow shops
• A large step random walk for minimizing total weighted tardiness in a job shop
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
• Effective neighbourhood functions for the flexible job shop problem
• Routing and scheduling in a flexible job shop by tabu search
• A weighted modified due date rule for sequencing to minimize weighted tardiness
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
• A genetic algorithm for the flexible job-shop scheduling problem
• A computational study of shifting bottleneck procedures for shop scheduling problems
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• A dynamic topological sort algorithm for directed acyclic graphs
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Measures of subproblem criticality in decomposition algorithms for shop scheduling
• Heuristics for minimizing total weighted tardiness in complex job shops
• Scheduling
• Variable neighborhood search: Principles and applications

This page was built for publication: Heuristic approaches for scheduling jobs in large-scale flexible job shops