This study presents optimization models for large vehicle routing problems using a spreadsheet solver and Python programming language with extended graphic card boosting computing power. Near optimality is feasible and attainable with spreadsheet tools and models for solving real-life problems....

This paper mainly studies a class of generalized sum-of-linear-fractions programming problems which have important applications in finance, economy and computational vision. In this process, we first propose a new method to re-represent the original problem as an equivalent problem (EP) with...

To solve the technician scheduling problem, this paper establishes a technician scheduling model considering the task release time, and designs a branch delimitation algorithm to solve the problem accurately by fully utilizing each technician's skills and allocating limited human resources to...

The geographical dispersion of collaborative factories may provide the cost-saving potential for manufacturers and lead them to easier fit the global markets. On the other hand, in such networks of factories, coordination is very important for the just-in-time delivery of orders. This study...

We consider a competitive facility location model with uncertain customers’ parameters. The model is built on the base of a Stackelberg game framework where competing parties (the Leader and the Follower) sequentially decide on opening their facilities. In the model, the Leader does not have a...

This paper investigates single machine scheduling problems with release time and random processing time, where the release time can be either deterministic or random. The objective is to determine a scheduling sequence that performs well in terms of out-of-sample performance. To achieve this, we...

In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The TSP-rd considers a single vehicle and a set of customers that must be served exactly once with goods that arrive to the depot over time, during the planning horizon. The time...

This paper proposes a branch-and-bound algorithm (B&B) for the proactive scheduling problem, which incorporates a degree of anticipation for variability in practical projects. First, the resource-constrained proactive scheduling model is formulated. Second, solving its resource-unconstrained...

Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine...