A new heuristic for open shop total completion time problem

DOI10.1016/j.apm.2009.06.014zbMath1185.90096OpenAlexW1989495531MaRDI QIDQ967860

Danyu Bai, Lixin Tang

Publication date: 2 May 2010

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2009.06.014

zbMATH Keywords

total completion timeopen shop problemasymptotical analysis

Mathematics Subject Classification ID

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

Related Items (3)

A new particle swarm optimization for multi-objective open shop scheduling ⋮ On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem ⋮ Multi-objective open shop scheduling by considering human error and preventive maintenance

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps
• The total completion time open shop scheduling problem with a given sequence of jobs on one machine
• Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
• Scheduling the Open Shop to Minimize Mean Flow Time
• Open shop problems with unit time operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: A new heuristic for open shop total completion time problem