Insertion techniques for the heuristic solution of the job shop problem

DOI10.1016/0166-218X(93)E0127-KzbMath0833.90073WikidataQ57634004 ScholiaQ57634004MaRDI QIDQ1805458

Andreas Winkler, Frank Werner

Publication date: 17 May 1995

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

zbMATH Keywords

beam searchjob shopheuristic solutioninsertion techniques

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Ant colony optimisation with parameterised search space for the job shop scheduling problem, A novel threshold accepting meta-heuristic for the job-shop scheduling problem, A disjunctive graph model and framework for constructing new train schedules, Feasible insertions in job shop scheduling, short cycles and stable sets, Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop, Optimal job insertion in the no-wait job shop, The seeds of the NEH algorithm: an overview using bibliometric analysis, Job-shop scheduling with processing alternatives., Heuristic constructive algorithms for open shop scheduling to minimize mean flow time, The museum visitor routing problem, Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem, Solving the open shop scheduling problem, Minimizing L _max for large-scale, job-shop scheduling problems, A sequencing approach for creating new train timetables, MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry, Deterministic job-shop scheduling: Past, present and future, A lower bound for the job insertion problem., Heuristics for permutation flow shop scheduling with batch setup times, Analysis of reactive deadlock-free scheduling in flexible job shops, Constructive heuristic algorithms for the open shop problem, A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size, Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure, Tabu search for the job-shop scheduling problem with multi-purpose machines, Maintaining longest paths incrementally

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of priority rule-based scheduling
• Constructive heuristic algorithms for the open shop problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme
• The Single Machine Early/Tardy Problem
• An Algorithm for Solving the Job-Shop Problem
• Tabu Search—Part I
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• A Direct Search Method to Locate Negative Cycles in a Graph