Insertion techniques for the heuristic solution of the job shop problem

DOI10.1016/0166-218X(93)E0127-KMaRDI QIDQ1805458zbMATH OpenDBLPWikidataFDO

Authors Frank Werner, Andreas Winkler

Publication date 17 May 1995

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

Full work available at URL https://doi.org/10.1016/0166-218X(93)E0127-K

zbMATH Keywords

beam searchheuristic solutioninsertion techniquesjob shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On the application of insertion techniques for job shop problems with setup times
• Job shop scheduling with beam search
• Feasible insertions in job shop scheduling, short cycles and stable sets
• Job-shop scheduling with processing alternatives.
• Advanced search techniques for the job shop problem : a comparison

Cites work

• A Direct Search Method to Locate Negative Cycles in a Graph
• A survey of priority rule-based scheduling
• An Algorithm for Solving the Job-Shop Problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Constructive heuristic algorithms for the open shop problem
• scientific article; zbMATH DE number 3839671 (Why is no real title available?)
• scientific article; zbMATH DE number 4156186 (Why is no real title available?)
• scientific article; zbMATH DE number 4020829 (Why is no real title available?)
• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• Tabu Search—Part I
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• The Single Machine Early/Tardy Problem
• Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme

Cited in

(27)

• Analysis of reactive deadlock-free scheduling in flexible job shops
• Constructive heuristic algorithms for the open shop problem
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• Job-shop scheduling with processing alternatives.
• 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
• 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
• A novel threshold accepting meta-heuristic for the job-shop scheduling problem
• A sequencing approach for creating new train timetables
• A disjunctive graph model and framework for constructing new train schedules
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
• Optimal job insertion in the no-wait job shop
• Feasible job insertions in the multi-processor-task job shop
• Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
• Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
• Ant colony optimisation with parameterised search space for the job shop scheduling problem
• On the application of insertion techniques for job shop problems with setup times
• Minimizing L _max for large-scale, job-shop scheduling problems
• Solving the open shop scheduling problem
• The seeds of the NEH algorithm: an overview using bibliometric analysis
• A speed-up procedure and new heuristics for the classical job shop scheduling problem: a computational evaluation
• Maintaining longest paths incrementally
• Feasible insertions in job shop scheduling, short cycles and stable sets
• The museum visitor routing problem
• MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry

This page was built for publication: Insertion techniques for the heuristic solution of the job shop problem

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