A new neighborhood and tabu search for the blocking job shop

DOI10.1016/j.dam.2009.02.020zbMath1185.90076OpenAlexW2067814550MaRDI QIDQ967433

Andreas Klinkert, Heinz Groeflin

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/11475/3627

zbMATH Keywords

tabu searchjob shop schedulingblockingdisjunctive graphsetup

Mathematics Subject Classification ID

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

Related Items (16)

Group-shop scheduling with sequence-dependent set-up and transportation times ⋮ A survey of job shop scheduling problem: the types and models ⋮ A hybrid metaheuristic algorithm to optimise a real-world robotic cell ⋮ Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements ⋮ Optimal job insertion in the no-wait job shop ⋮ A neighborhood for complex job shop scheduling problems with regular objectives ⋮ An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots ⋮ Approaches to modeling train scheduling problems as job-shop problems with blocking constraints ⋮ Efficient primal heuristic updates for the blocking job shop problem ⋮ Scheduling coupled-operation jobs with exact time-lags ⋮ The flexible blocking job shop with transfer and set-up times ⋮ A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization ⋮ The blocking job shop with rail-bound transportation ⋮ Scheduling for multi-robot routing with blocking and enabling constraints

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• A rollout metaheuristic for job shop scheduling problems
• Feasible insertions in job shop scheduling, short cycles and stable sets
• A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
• Cyclic job shop scheduling problems with blocking
• Sequencing of jobs in some production system
• Deterministic job-shop scheduling: Past, present and future
• Job-shop scheduling with blocking and no-wait constraints
• A branch and bound algorithm for scheduling trains in a railway network
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Alternative graph formulation for solving complex factory-scheduling problems
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: A new neighborhood and tabu search for the blocking job shop