Pages that link to "Item:Q967860"
From MaRDI portal
The following pages link to A new heuristic for open shop total completion time problem (Q967860):
Displaying 11 items.
- Scheduling open shops with parallel machines to minimize total completion time (Q609214) (← links)
- A contribution and new heuristics for open shop scheduling (Q733548) (← links)
- Constructive heuristic algorithms for the open shop problem (Q1310611) (← links)
- The total completion time open shop scheduling problem with a given sequence of jobs on one machine (Q1603323) (← links)
- New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
- Multi-objective open shop scheduling by considering human error and preventive maintenance (Q2307240) (← links)
- Heuristic constructive algorithms for open shop scheduling to minimize mean flow time (Q2482764) (← links)
- A new particle swarm optimization for multi-objective open shop scheduling (Q2903242) (← links)
- On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem (Q5168014) (← links)
- An heuristic approach for solving OSSP with a objective of minimizing total completion time and resource idleness (Q6051979) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)