The following pages link to Albert Corominas (Q184565):
Displaying 39 items.
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) (Q322556) (← 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)
- 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)
- Using a MILP model to establish a framework for an annualised hours agreement (Q857276) (← links)
- Response time variability (Q880584) (← links)
- Scheduling production of multiple part-types in a system with pre-known demands and deterministic inactive time intervals (Q958115) (← links)
- Mathematical programming modeling of the response time variability problem (Q1042486) (← links)
- (Q1266567) (redirect page) (← links)
- Heuristics and exact algorithms for solving the Monden problem (Q1266568) (← links)
- Procedures for solving a 1-dimensional cutting problem (Q1333482) (← links)
- Modelling and solving the production rate variation problem (PRVP) (Q1383316) (← links)
- Note on cyclic sequences in the product rate variation problem (Q1577992) (← links)
- Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization (Q1592632) (← links)
- A remark about ''A comment on consecutive-2-out-of-n systems'' (Q1612005) (← links)
- Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints (Q1653370) (← links)
- Using optimal control to optimize the extraction rate of a durable non-renewable resource with a monopolistic primary supplier (Q2165773) (← 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)
- 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)
- Planning production and working time within an annualised hours scheme framework (Q2468729) (← links)
- Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem (Q2571186) (← links)
- (Q2920828) (← links)
- Production planning under a working time accounts scheme (Q3055394) (← 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)
- An exact procedure for planning holidays and working time under annualized hours considering cross-trained workers with different efficiencies (Q3533188) (← links)
- Using MILP to plan annualised working hours (Q4656727) (← 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)
- (Q5323366) (← links)
- (Q5323401) (← links)
- (Q5323404) (← links)
- A Note on the Relation between the Product Rate Variation (PRV) Problem and the Apportionment Problem (Q5690278) (← links)
- Solving the generalized apportionment problem through the optimization of discrepancy functions (Q5935397) (← links)
