A new neighborhood and tabu search for the blocking job shop

DOI10.1016/J.DAM.2009.02.020MaRDI QIDQ967433zbMATH OpenOpenAlexFDO

Authors 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

blockingdisjunctive graphjob shop schedulingsetuptabu search

Mathematics Subject Classification ID

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

Recommendations

• An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem
• The flexible blocking job shop with transfer and set-up times
• Cyclic job shop scheduling problems with blocking
• A neighborhood for complex job shop scheduling problems with regular objectives
• A permutation-based neighborhood for the blocking job-shop problem with total tardiness minimization

Cites work

• A branch and bound algorithm for scheduling trains in a railway network
• A Computational Study of the Job-Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A rollout metaheuristic for job shop scheduling problems
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
• Alternative graph formulation for solving complex factory-scheduling problems
• Cyclic job shop scheduling problems with blocking
• Deterministic job-shop scheduling: Past, present and future
• Feasible insertions in job shop scheduling, short cycles and stable sets
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• Job-shop scheduling with blocking and no-wait constraints
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Operations scheduling with applications in manufacturing and services. With 3.5 disk package
• Sequencing of jobs in some production system
• The Shifting Bottleneck Procedure for Job Shop Scheduling

Cited in

(17)

• Group-shop scheduling with sequence-dependent set-up and transportation times
• A hybrid metaheuristic algorithm to optimise a real-world robotic cell
• Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
• Scheduling for multi-robot routing with blocking and enabling constraints
• A survey of job shop scheduling problem: the types and models
• Efficient primal heuristic updates for the blocking job shop problem
• 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
• Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements
• Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots
• A permutation-based neighborhood for the blocking job-shop problem with total tardiness minimization
• The blocking job shop with rail-bound transportation
• Scheduling coupled-operation jobs with exact time-lags
• The flexible blocking job shop with transfer and set-up times
• Cyclic job shop scheduling problems with blocking

Describes a project that uses

Uses Software

• Tabu search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967433)