The following pages link to Rubén Ruiz (Q297244):
Displaying 50 items.
- A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
- New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
- Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems (Q537990) (← links)
- Algorithms for a realistic variant of flowshop scheduling (Q732880) (← links)
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
- Considering scheduling and preventive maintenance in the flowshop sequencing problem (Q883296) (← links)
- Modeling realistic hybrid flexible flowshop scheduling problems (Q941540) (← links)
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
- Cooperative metaheuristics for the permutation flowshop scheduling problem (Q958077) (← links)
- Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459) (← links)
- Architecture of manufacturing scheduling systems: literature review and an integrated proposal (Q976436) (← links)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
- Shifting representation search for hybrid flexible flowline problems (Q992723) (← links)
- The distributed permutation flowshop scheduling problem (Q1040975) (← links)
- A decision support system for a real vehicle routing problem. (Q1420384) (← links)
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times (Q1628056) (← links)
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
- OR models in urban service facility location: a critical review of applications and future developments (Q1728469) (← links)
- Heuristics for periodical batch job scheduling in a MapReduce computing framework (Q1750408) (← links)
- Matheuristics for the irregular bin packing problem with free rotations (Q1751657) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- An effective heuristic for project scheduling with resource availability cost (Q1752859) (← links)
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources (Q1753460) (← links)
- An iterated greedy heuristic for a market segmentation problem with multiple attributes (Q1753559) (← links)
- Integer programming models for the pre-marshalling problem (Q1755240) (← links)
- Scheduling unrelated parallel machines with optional machines and jobs selection (Q1762164) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics (Q1776952) (← links)
- Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908) (← links)
- Mass casualty management in disaster scene: a systematic review of OR\&MS research in humanitarian operations (Q2023962) (← links)
- Bi-objective parallel machine scheduling with additional resources during setups (Q2030593) (← links)
- Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach (Q2185520) (← links)
- An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects (Q2195404) (← links)
- Benders decomposition for the mixed no-idle permutation flowshop scheduling problem (Q2197331) (← links)
- The hybrid flow shop scheduling problem (Q2270289) (← links)
- Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868) (← links)
- A branch and bound approach for large pre-marshalling problems (Q2424778) (← links)
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives (Q2467260) (← links)
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time (Q2468768) (← links)
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility (Q2572852) (← links)
- Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm (Q2668804) (← links)
- A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows (Q2673560) (← links)
- A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem (Q2901027) (← links)
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization (Q2958668) (← links)
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness (Q3055285) (← links)
- Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms (Q4661112) (← links)
- Performance Analysis for Heterogeneous Cloud Servers Using Queueing Theory (Q5125899) (← links)
- Local Search in Complex Scheduling Problems (Q5429301) (← links)
- A constraint programming approach for the premarshalling problem (Q6106491) (← links)
