The following pages link to Rafael Pastor (Q322555):
Displaying 49 items.
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) (Q322556) (← links)
- Minimising maximum response time (Q336510) (← links)
- Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) (Q337057) (← links)
- Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1) (Q337613) (← links)
- MILP-based heuristics for the design of rural community electrification projects (Q342343) (← links)
- Planning annualised hours with a finite set of weekly working hours and joint holidays (Q596438) (← links)
- Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems. (Q703298) (← links)
- Planning working time accounts under demand uncertainty (Q709199) (← links)
- Using a MILP model to establish a framework for an annualised hours agreement (Q857276) (← links)
- A proposal for a hybrid meta-strategy for combinatorial optimization problems (Q945052) (← links)
- Introducing dynamic diversity into a discrete particle swarm optimization (Q955627) (← links)
- Scheduling production of multiple part-types in a system with pre-known demands and deterministic inactive time intervals (Q958115) (← links)
- Solving the response time variability problem by means of a psychoclonal approach (Q972638) (← links)
- Planning production using mathematical programming: The case of a woodturning company (Q1013389) (← links)
- Solving the response time variability problem by means of a genetic algorithm (Q1039773) (← links)
- Mathematical programming modeling of the response time variability problem (Q1042486) (← links)
- Corrigendum to ``Balancing and scheduling tasks in assembly lines with sequence-dependent setup'' [European Journal of Operational Research 187 (2008) 1212-1223] (Q1044178) (← links)
- Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization (Q1592632) (← links)
- The multi-objective assembly line worker integration and balancing problem of type-2 (Q1652274) (← links)
- Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints (Q1653370) (← links)
- Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints (Q2140318) (← links)
- A MILP model to design hybrid wind-photovoltaic isolated rural electrification projects in developing countries (Q2253569) (← links)
- An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem (Q2271118) (← links)
- Hyper-heuristic approaches for the response time variability problem (Q2275609) (← links)
- An entropy-based measurement of working time flexibility (Q2379553) (← links)
- Human resource management using working time accounts with expiry of hours (Q2379806) (← links)
- Selecting and adapting weekly work schedules with working time accounts: a case of a retail clothing chain (Q2383100) (← links)
- Planning annualised hours with a finite set of weekly working hours and cross-trained workers (Q2432896) (← links)
- A branch and bound algorithm for the response time variability problem (Q2434314) (← links)
- Balancing and scheduling tasks in assembly lines with sequence-dependent setup times (Q2467265) (← links)
- Planning production and working time within an annualised hours scheme framework (Q2468729) (← links)
- A survey of the parallel assembly lines balancing problem (Q2664411) (← links)
- (Q2920828) (← links)
- Production planning under a working time accounts scheme (Q3055394) (← links)
- An improved mathematical program to solve the simple assembly line balancing problem (Q3055448) (← links)
- A Parametric Multi-start Algorithm for Solving the Response Time Variability Problem (Q3068892) (← links)
- Replanning working time under annualised working hours (Q3163721) (← links)
- (Q3179375) (← links)
- ASALBP: the alternative subgraphs assembly line balancing problem (Q3498913) (← links)
- An exact procedure for planning holidays and working time under annualized hours considering cross-trained workers with different efficiencies (Q3533188) (← links)
- The ASALB Problem with Processing Alternatives Involving Different Tasks: Definition, Formalization and Resolution (Q3600132) (← links)
- Using MILP to plan annualised working hours (Q4656727) (← links)
- (Q4849802) (← links)
- Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics) (Q4929857) (← links)
- Capacity planning with working time accounts in services (Q4933610) (← links)
- Methodology for integrated multicriteria decision-making with uncertainty: extending the compromise ranking method for uncertain evaluation of alternatives (Q6058068) (← links)
- Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times (Q6106588) (← links)
- Matheuristics for scheduling of maintenance service with linear operation cost and step function maintenance cost (Q6554602) (← links)
- Heuristic and metaheuristic procedures for the parallel assembly lines balancing problem with multi-line workstations and buffer sizing (Q6568391) (← links)
