Heuristic constructive algorithms for open shop scheduling to minimize mean flow time

DOI10.1016/J.EJOR.2007.02.057MaRDI QIDQ2482764zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Heidemarie Bräsel, André Herms, Marc Mörig, Thomas Tautenhahn, Jan Tusch, Frank Werner

Publication date 24 April 2008

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

Full work available at URL https://doi.org/10.1016/j.ejor.2007.02.057

zbMATH Keywords

constructive heuristicsmean flow timeopen shop scheduling

Mathematics Subject Classification ID

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

Recommendations

• Constructive heuristic algorithms for the open shop problem
• scientific article; zbMATH DE number 4170622
• A new heuristic for open shop total completion time problem
• New efficient heuristics for scheduling open shops with makespan minimization
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop

Cites work

• Constructive heuristic algorithms for the open shop problem
• scientific article; zbMATH DE number 432988 (Why is no real title available?)
• Insertion techniques for the heuristic solution of the job shop problem
• On the open-shop problem with preemption and minimizing the average completion time
• Scheduling the Open Shop to Minimize Mean Flow Time
• Solving the open shop scheduling problem
• The total completion time open shop scheduling problem with a given sequence of jobs on one machine

Cited in

(12)

• Classical and new heuristics for the open-shop problem: A computational evaluation
• Constructive heuristic algorithms for the open shop problem
• Open shop cyclic scheduling
• New efficient heuristics for scheduling open shops with makespan minimization
• A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
• Aggregation heuristic for the open-pit block scheduling problem
• scientific article; zbMATH DE number 4170622 (Why is no real title available?)
• On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem
• Scheduling preemptive open shops to minimize total tardiness
• A contribution and new heuristics for open shop scheduling
• A new heuristic for open shop total completion time problem

This page was built for publication: Heuristic constructive algorithms for open shop scheduling to minimize mean flow time

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