The following pages link to Jordi Pereira (Q319442):
Displaying 30 items.
- Network construction problems with due dates (Q319443) (← links)
- Procedures for the bin packing problem with precedence constraints (Q322561) (← links)
- Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376) (← links)
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
- The robust set covering problem with interval data (Q367647) (← links)
- Procedures for the time and space constrained assembly line balancing problem (Q421558) (← links)
- Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
- A GRASP approach for the extended car sequencing problem (Q835577) (← links)
- Ant algorithms for a time and space constrained assembly line balancing problem (Q857344) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- A beam search approach for the optimization version of the car sequencing problem (Q940889) (← links)
- A dynamic programming based heuristic for the assembly line balancing problem (Q958561) (← links)
- Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach (Q1652235) (← links)
- The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
- A memetic algorithm for the cost-oriented robotic assembly line balancing problem (Q1654375) (← links)
- The single machine weighted mean squared deviation problem (Q1753598) (← links)
- Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints (Q1985052) (← links)
- On the complexity of assembly line balancing problems (Q2003432) (← links)
- Tree optimization based heuristics and metaheuristics in network construction problems (Q2027081) (← links)
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution (Q2178337) (← links)
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences (Q2189916) (← links)
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems (Q2257352) (← links)
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time (Q2355812) (← links)
- Solving an urban waste collection problem using ants heuristics (Q2475858) (← links)
- (Q4438846) (← links)
- Lateness Minimization in Pairwise Connectivity Restoration Problems (Q5136078) (← links)
- Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)
- Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems (Q6069215) (← links)
- Exact and heuristic methods for a workload allocation problem with chain precedence constraints (Q6112777) (← links)
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem (Q6568392) (← links)
