On the open-shop problem with preemption and minimizing the average completion time

DOI10.1016/S0377-2217(03)00249-2zbMath1067.90040MaRDI QIDQ703917

Heidemarie Bräsel, Holger Hennes

Publication date: 12 January 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

ModellingHeuristicsScheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop ⋮ Heuristic constructive algorithms for open shop scheduling to minimize mean flow time

Uses Software

• LiSA

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling ordered open shops
• On the complexity of preemptive open-shop scheduling problems
• On the solution region for certain scheduling problems with preemption
• Constructive heuristic algorithms for the open shop problem
• Benchmarks for basic scheduling problems
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: On the open-shop problem with preemption and minimizing the average completion time