Pages that link to "Item:Q1576331"
From MaRDI portal
The following pages link to A hybrid genetic algorithm for the open shop scheduling problem (Q1576331):
Displayed 31 items.
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises (Q492852) (← links)
- A contribution and new heuristics for open shop scheduling (Q733548) (← links)
- Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines (Q878937) (← links)
- Quality inspection scheduling for multi-unit service enterprises (Q953432) (← links)
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
- The museum visitor routing problem (Q969135) (← links)
- A genetic algorithm for the proportionate multiprocessor open shop (Q1010271) (← links)
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
- An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
- Open shop cyclic scheduling (Q1750495) (← links)
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling (Q1764767) (← links)
- Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← links)
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports (Q2023947) (← links)
- A matheuristic for the generalized order acceptance and scheduling problem (Q2077965) (← links)
- New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
- Boosting ant colony optimization via solution prediction and machine learning (Q2147035) (← links)
- A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates (Q2160790) (← links)
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms (Q2432849) (← links)
- Solving machine-loading problem of a flexible manufacturing system with constraint-based genetic algorithm (Q2433464) (← links)
- A tabu search approach for proportionate multiprocessor open shop scheduling (Q2450907) (← links)
- A review of some issues and identification of some barriers in the implementation of FMS (Q2460092) (← links)
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem (Q2471233) (← links)
- A new particle swarm optimization for the open shop scheduling problem (Q2482375) (← links)
- A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains (Q2491781) (← links)
- A new particle swarm optimization for multi-objective open shop scheduling (Q2903242) (← links)
- A simple model for the multiple traveling salesmen problem with single depot and multiple sink (Q2970607) (← links)
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (Q6164629) (← links)