Efficient primal heuristic updates for the blocking job shop problem

DOI10.1016/J.EJOR.2021.02.051MaRDI QIDQ2239845zbMATH OpenOpenAlexFDO

Authors Jayanth Krishna Mogali, Laura Barbulescu, Stephen F. Smith

Publication date 5 November 2021

Published in European Journal of Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.ejor.2021.02.051

zbMATH Keywords

blocking job shop problemheuristicsjob insertionjob insertion polytopemakespan minimization

Mathematics Subject Classification ID

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

Recommendations

• A new neighborhood and tabu search for the blocking job shop
• An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem
• Cyclic job shop scheduling problems with blocking
• A permutation-based neighborhood for the blocking job-shop problem with total tardiness minimization
• Scheduling blocking flowshops with setup times via constraint guided and accelerated local search

Cites work

• A branch and bound algorithm for scheduling trains in a railway network
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A lower bound for the job insertion problem.
• A neighborhood for complex job shop scheduling problems with regular objectives
• A new neighborhood and tabu search for the blocking job shop
• A rollout metaheuristic for job shop scheduling problems
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• An advanced tabu search algorithm for the job shop problem
• An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem
• Applying tabu search to the job-shop scheduling problem
• Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
• Benchmarks for basic scheduling problems
• Cyclic job shop scheduling problems with blocking
• Feasible insertions in job shop scheduling, short cycles and stable sets
• Guided local search with shifting bottleneck for job shop scheduling
• Job-shop scheduling with blocking and no-wait constraints
• Scheduling trains as a blocking parallel-machine job shop scheduling problem
• The flexible blocking job shop with transfer and set-up times
• The job shop scheduling problem: Conventional and new solution techniques
• The Shifting Bottleneck Procedure for Job Shop Scheduling

Cited in

(3)

• Scheduling for multi-robot routing with blocking and enabling constraints
• A real-world mine excavators timetabling methodology in open-pit mining
• A unified solution framework for flexible job shop scheduling problems with multiple resource constraints

This page was built for publication: Efficient primal heuristic updates for the blocking job shop problem

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