Pages that link to "Item:Q609214"
From MaRDI portal
The following pages link to Scheduling open shops with parallel machines to minimize total completion time (Q609214):
Displaying 12 items.
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing (Q264277) (← links)
- The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
- Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
- A single-machine bi-criterion scheduling problem with two agents (Q482429) (← links)
- Hybrid flexible flowshop problems: models and solution methods (Q1634549) (← links)
- Large-scale medical examination scheduling technology based on intelligent optimization (Q1740432) (← links)
- A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop (Q1792291) (← links)
- A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities (Q1991454) (← links)
- Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem (Q2031353) (← links)
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
- A tabu search approach for proportionate multiprocessor open shop scheduling (Q2450907) (← links)
- Two-machine open shop problem with a single server and set-up time considerations (Q2663040) (← links)
