Constructive heuristic algorithms for the open shop problem

DOI10.1007/BF02243845zbMath0796.90031WikidataQ57634033 ScholiaQ57634033MaRDI QIDQ1310611

Frank Werner, Heidemarie Bräsel, Thomas Tautenhahn

Publication date: 26 September 1994

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

branch and bound; makespan; heuristic; maximum completion time; \(m\)-machine open shop scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Solving the open shop scheduling problem, On the open-shop problem with preemption and minimizing the average completion time, Classical and new heuristics for the open-shop problem: A computational evaluation, A branch \(\&\) bound algorithm for the open-shop problem, Job-shop scheduling with processing alternatives., An efficient tabu search approach for the two-machine preemptive open shop scheduling problem., A hybrid genetic algorithm for the open shop scheduling problem, 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, Insertion techniques for the heuristic solution of the job shop problem, Heuristics for permutation flow shop scheduling with batch setup times, Scheduling two-machine preemptive open shops to minimize total completion time, A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times, Metaheuristics: A bibliography, Benchmarks for basic scheduling problems, Heuristic constructive algorithms for open shop scheduling to minimize mean flow time

Cites Work

• Unnamed Item
• Unnamed Item
• 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