Narrow search
Showing 1 - 10 of 243
Cover Image
The freight allocation problem with lane cost balancing constraint
Lim, Andrew; Qin, Hu; Xu, Zhou - In: European Journal of Operational Research 217 (2012) 1, pp. 26-35
We consider a problem faced by a buying office for one of the largest retail distributors in the world. The buying office plans the distribution of goods from Asia to various destinations across Europe. The goods are transported along shipping lanes by shipping companies, many of which have...
Persistent link: https://www.econbiz.de/10010574182
Cover Image
A tabu search approach for cell scheduling problem with makespan criterion
Solimanpur, Maghsud; Elmi, Atabak - In: International journal of production economics 141 (2013) 2, pp. 639-645
Persistent link: https://www.econbiz.de/10009731223
Cover Image
A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages
Figielska, Ewa - In: European journal of operational research : EJOR 236 (2014) 2, pp. 433-444
Persistent link: https://www.econbiz.de/10010366179
Cover Image
Flexible job-shop scheduling problems with "AND"/"OR" precedence constraints
Lee, Sanghyup; Moon, Ilkyeong; Bae, Hyerim; Kim, Jion - In: International journal of production research 50 (2012) 7, pp. 1979-2001
Persistent link: https://www.econbiz.de/10009563773
Cover Image
Design-balanced capacitated multicommodity network design with heterogeneous assets
Li, Xiangyong; Wei, Kai; Aneja, Yash P.; Tian, Peng - In: Omega : the international journal of management science 67 (2017), pp. 145-159
Persistent link: https://www.econbiz.de/10011630515
Cover Image
Heuristic algorithms for scheduling intrees on m machines with non-availability constraints
Abdellafou, Khaoula Ben; Hadda, Hatem; Korbaa, Ouajdi - In: Operational research : an international journal 21 (2021) 1, pp. 55-71
Persistent link: https://www.econbiz.de/10012489664
Cover Image
A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages
Figielska, Ewa - In: European Journal of Operational Research 236 (2014) 2, pp. 433-444
In this paper we propose a heuristic for solving the problem of resource constrained preemptive scheduling in the two … minimization of makespan. The problem is NP-hard. The heuristic first sequences jobs on the machine at stage 1 and then solves the … sharing of the resources between the stages is taken into account is also derived. The performance of the heuristic evaluated …
Persistent link: https://www.econbiz.de/10010753509
Cover Image
A tabu search approach for cell scheduling problem with makespan criterion
Solimanpur, Maghsud; Elmi, Atabak - In: International Journal of Production Economics 141 (2013) 2, pp. 639-645
Scheduling problem in a cellular manufacturing system is treated as the group scheduling problem, assuming that intercellular moves can be eliminated by duplicating machines. However, in a typical CMS, duplicating bottleneck machines may be costly and infeasible. This fact limits the...
Persistent link: https://www.econbiz.de/10010869115
Cover Image
Tabu search for the BWC problem
Berend, Daniel; Korach, Ephraim; Zucker, Shira - In: Journal of Global Optimization 54 (2012) 4, pp. 649-667
black and W white vertices, such that there is no edge between a black and a white vertex. We suggest a heuristic, based on …
Persistent link: https://www.econbiz.de/10010600691
Cover Image
A petrol station replenishment problem: new variant and formulation
Benantar, Abdelaziz; Ouafi, Rachid; Boukachour, Jaouad - In: Logistics Research 9 (2016) 1, pp. 1-18
One of the most important problems in the petroleum industry is the well-known petrol station replenishment problem with time windows, which calls for the determination of optimal routes by using a fleet of tank trucks to serve a set of petrol stations over a given planning horizon. In this...
Persistent link: https://www.econbiz.de/10011643796