This study introduces a green location, routing and inventory problem with customer satisfaction, backup distribution centers and risk of routes in the form of a non-linear mixed integer programming model. In this regard, time window is considered to increase the customer satisfaction of the model and transportation risks is taken into account for the reliability of the system. In addition, dif...

this article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. regarding the np-hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. a number of test problems are randomly generat...

Given a pattern string P and a text string T , the one-dimensional real-scale pattern matching problem asks for all matched positions in T at which P occurs for some real scales ≥ 1. This problem was first proposed by Amir et al., who also gave an algorithm with O(n + |P |) time for solving it, where |T | = n. Recently, Wang et al. proposed a preprocessing on T with O(n) time and space, with wh...

This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...

The simplest model of this form is for the graph bisection problem. This is the problem of partitioning the vertices of a graph into two equal-sized sets while minimizing the number of edges bridging the sets. To create an instance of the planted bisection problem, we first choose a paritition of the vertices into equal-sized sets V 1 and V 2. When then choose probabilities p > q, and place edg...