Pages that link to "Item:Q1818565"
From MaRDI portal
The following pages link to Open shop scheduling with makespan and total completion time criteria (Q1818565):
Displaying 13 items.
- Scheduling open shops with parallel machines to minimize total completion time (Q609214) (← links)
- Open shops with jobs overlap -- revisited (Q706904) (← links)
- A new heuristic for open shop total completion time problem (Q967860) (← links)
- Openshop and flowshop scheduling to minimize sum of completion times (Q1086145) (← links)
- Open shop scheduling with machine dependent processing times (Q1201806) (← links)
- Two machine open shop scheduling problems with bi-criteria (Q1331894) (← links)
- Open shop scheduling with maximal machines (Q1377665) (← 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)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- Two-machine open shop scheduling with secondary criteria (Q3044040) (← links)
- Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) (← links)