The following pages link to Rym M'Hallah (Q282250):
Displaying 37 items.
- Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem (Q282252) (← links)
- (Q340265) (redirect page) (← links)
- Packing unit spheres into the smallest sphere using VNS and NLP (Q340267) (← links)
- A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
- A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity (Q547125) (← links)
- A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
- On the performance of managers and controllers: a polymatrix game approach for the manager-controller-board of directors' conflict (Q725890) (← links)
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← links)
- Beam search and non-linear programming tools for the circular packing problem (Q843379) (← links)
- Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934) (← links)
- Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591) (← links)
- (Q960399) (redirect page) (← links)
- A beam search algorithm for the circular packing problem (Q960400) (← links)
- An agent-based approach to the two-dimensional guillotine bin packing problem (Q1011220) (← links)
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems (Q1046051) (← links)
- Heuristic algorithms for the two-stage hybrid flowshop problem (Q1371955) (← links)
- Minimizing the weighted number of tardy jobs on a two-machine flow shop. (Q1413849) (← links)
- Approximate algorithms for constrained circular cutting problems (Q1433164) (← links)
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates (Q1754152) (← links)
- Minimizing the weighted number of tardy jobs on a single machine (Q1869424) (← links)
- Minimizing the weighted number of tardy jobs on parallel processors (Q1887912) (← links)
- A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem (Q2077966) (← links)
- Optimal inventory policies for a two-dimensional stochastic inventory model: a numerical investigation (Q2177836) (← links)
- A multi-agent system for the weighted earliness tardiness parallel machine problem (Q2257353) (← links)
- Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems (Q2490166) (← links)
- A dynamic adaptive local search algorithm for the circular packing problem (Q2643959) (← links)
- (Q2772564) (← links)
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry (Q2803270) (← links)
- Packing Unit Spheres into a Cube Using VNS (Q2840774) (← links)
- Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem (Q2901006) (← links)
- Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543) (← links)
- Lower and upper bounds for the continuous single facility location problem in the presence of a forbidden region and travel barrier (Q5001365) (← links)
- A beam search for the equality generalized symmetric traveling salesman problem (Q5034720) (← links)
- On the impact of corruption on managers’ and controllers’ behavior (Q5034791) (← links)
- Minimizing Weighted Earliness and Tardiness on Parallel Machines Using a Multi-Agent System (Q5171823) (← links)
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems (Q5322078) (← links)
