A neighborhood for complex job shop scheduling problems with regular objectives
From MaRDI portal
Publication:2400045
DOI10.1007/s10951-017-0532-2zbMath1375.90120OpenAlexW2731178343MaRDI QIDQ2400045
Publication date: 25 August 2017
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/330572/files/2017_Buergy_Neighborhood.pdf
tabu searchjob shop schedulingsequence-dependent setup timesneighborhoodjob insertiongeneral regular objectiveblocking job shop
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (5)
Pattern mining‐based pruning strategies in stochastic local searches for scheduling problems ⋮ Efficient primal heuristic updates for the blocking job shop problem ⋮ The job shop scheduling problem with convex costs ⋮ A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization ⋮ Scheduling for multi-robot routing with blocking and enabling constraints
Uses Software
Cites Work
- Unnamed Item
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis
- The flexible blocking job shop with transfer and set-up times
- Job shop scheduling with setup times, deadlines and precedence constraints
- Feasible insertions in job shop scheduling, short cycles and stable sets
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
- A new neighborhood and tabu search for the blocking job shop
- The job shop scheduling problem: Conventional and new solution techniques
- Parallel branch-and-bound methods for the job-shop scheduling problem
- A branch and bound algorithm for the job-shop scheduling problem
- A competent memetic algorithm for complex scheduling
- Job-shop scheduling with blocking and no-wait constraints
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- Testing heuristics: We have it all wrong
- A very fast TS/SA algorithm for the job shop scheduling problem
- A linear programming-based method for job shop scheduling
- An advanced tabu search algorithm for the job shop problem
- Fifty years of scheduling: a survey of milestones
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
- Complex Scheduling
- A Computational Study of the Job-Shop Scheduling Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- Scheduling
- The blocking job shop with rail-bound transportation
This page was built for publication: A neighborhood for complex job shop scheduling problems with regular objectives
