Constructive heuristic algorithms for the open shop problem

DOI10.1007/BF02243845zbMath0796.90031WikidataQ57634033 ScholiaQ57634033MaRDI QIDQ1310611

Thomas Tautenhahn, Heidemarie Bräsel, Frank Werner

Publication date: 26 September 1994

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

branch and boundmakespanheuristicmaximum completion time\(m\)-machine open shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Benchmarks for basic scheduling problems, Scheduling two-machine preemptive open shops to minimize total completion time, New efficient heuristics for scheduling open shops with makespan minimization, Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop, A branch \(\&\) bound algorithm for the open-shop problem, The representation of partially-concurrent open shop problems, A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times, Metaheuristics: A bibliography, A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan, Job-shop scheduling with processing alternatives., An efficient tabu search approach for the two-machine preemptive open shop scheduling problem., OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises, Four decades of research on the open-shop scheduling problem to minimize the makespan, Heuristic constructive algorithms for open shop scheduling to minimize mean flow time, The museum visitor routing problem, On the open-shop problem with preemption and minimizing the average completion time, Solving the open shop scheduling problem, A contribution and new heuristics for open shop scheduling, Insertion techniques for the heuristic solution of the job shop problem, An Optimal Constraint Programming Approach to the Open-Shop Problem, Heuristics for permutation flow shop scheduling with batch setup times, SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM, Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan, A hybrid genetic algorithm for the open shop scheduling problem, Classical and new heuristics for the open-shop problem: A computational evaluation, A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size, The total completion time open shop scheduling problem with a given sequence of jobs on one machine, Open shop scheduling problems with conflict graphs

Cites Work

• Insertion techniques for the heuristic solution of the job shop problem
• Benchmarks for basic scheduling problems
• Tabu Search—Part I
• Open Shop Scheduling to Minimize Finish Time
• On the number of feasible schedules of the open-shop-problem-an application of special latin rectangles
• Unnamed Item
• Unnamed Item