The following pages link to Aziz Moukrim (Q279818):
Displaying 49 items.
- Heuristic solutions for the vehicle routing problem with time windows and synchronized visits (Q279819) (← links)
- An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration (Q319357) (← links)
- Solving the team orienteering problem with cutting planes (Q342446) (← links)
- Preprocessing and an improved MIP model for examination timetabling (Q492792) (← links)
- Exact methods for the robotic cell problem (Q656059) (← links)
- Exact method for the two-machine flow-shop problem with time delays (Q829189) (← links)
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation (Q868985) (← links)
- The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm (Q967432) (← links)
- A memetic algorithm for the team orienteering problem (Q972625) (← links)
- An optimization-based heuristic for the robotic cell problem (Q1040983) (← links)
- An MILP for scheduling problems in an FMS with one vehicle (Q1042214) (← links)
- A polynomial algorithm for recognizing the \(\mathcal A\)-order class (Q1043599) (← links)
- (Q1267551) (redirect page) (← links)
- A relation between multiprocessor scheduling and linear programming (Q1267552) (← links)
- On the minimum number of processors for scheduling problems with communication delays (Q1290161) (← links)
- Optimal scheduling on parallel machines for a new order class (Q1306374) (← links)
- Upper bound on the number of processors for scheduling with interprocessor communication delays. (Q1403166) (← links)
- Lower bounds for the event scheduling problem with consumption and production of resources (Q1686062) (← links)
- Hybrid heuristic for the clustered orienteering problem (Q1691649) (← links)
- Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems (Q1734832) (← links)
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders (Q1811068) (← links)
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
- Integration of routing into a resource-constrained project scheduling problem (Q2175371) (← links)
- A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit (Q2196083) (← links)
- The clustered team orienteering problem (Q2273693) (← links)
- An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
- Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135) (← links)
- A new constraint programming approach for the orthogonal packing problem (Q2456654) (← links)
- A new exact method for the two-dimensional bin-packing problem with fixed orientation (Q2467477) (← links)
- New resolution algorithm and pretreatments for the two-dimensional bin-packing problem (Q2482368) (← links)
- Optimal preemptive scheduling on a fixed number of identical parallel machines (Q2488216) (← links)
- A new exact method for the two-dimensional orthogonal packing problem (Q2643952) (← links)
- Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows (Q2664372) (← links)
- (Q2741353) (← links)
- (Q2861503) (← links)
- Lower Bounds for the Minimal Sum Coloring Problem (Q2883634) (← links)
- New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem (Q3114308) (← links)
- (Q4253978) (← links)
- (Q4426346) (← links)
- Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays (Q4596504) (← links)
- Simultaneous job input sequencing and vehicle dispatching in a single-vehicle automated guided vehicle system: a heuristic branch-and-bound approach coupled with a discrete events simulation model (Q4681150) (← links)
- Parallel Machine Scheduling with Uncertain Communication Delays (Q4809662) (← links)
- A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem (Q4922922) (← links)
- Polynomial algorithms for some scheduling problems with one nonrenewable resource (Q5034755) (← links)
- The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders (Q5317601) (← links)
- A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays (Q5418015) (← links)
- New Lower Bounds on the Number of Vehicles for the Vehicle Routing Problem with Time Windows (Q5418747) (← links)
- Heuristic and metaheuristic methods for computing graph treewidth (Q5479837) (← links)
- GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows (Q6079871) (← links)
