The following pages link to (Q3607719):
Displaying 12 items.
- Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334) (← links)
- Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres (Q439612) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- Parametric approach and genetic algorithm for multi objective linear programming with imprecise parameters (Q707947) (← links)
- A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem (Q833641) (← links)
- Solving a concrete sleepers production scheduling by genetic algorithms (Q863974) (← links)
- On operators and search space topology in multi-objective flow shop scheduling (Q872256) (← links)
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach (Q880526) (← links)
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958) (← links)
- Skilled workforce scheduling in service centres (Q954927) (← links)
- Determination of cutoff time for express courier services: a genetic algorithm approach (Q5438557) (← links)
