We investigate the problem of minimizing the weighted number of tardy jobs on a single machine subject to availability constraints. We consider the case of semi-resumable jobs (1, hk|ri, sr − a| ∑ wiUi). We show that the problem is equivalent to a similar problem without availability constraints, but where the processing times of jobs are a stepwise function of their starting time. We design a ...

The locations of dwell points for idle vehicles in an automated guided vehicle (AGV) system determine the response times for pick-up requests and thus affect the performance of automated manufacturing systems. In this study, we address the problem of optimally locating dwell points for multiple AGVs in general guide-path layouts with the objective of minimizing the maximum response time in the ...

A regular timetable is a collection of events that repeat themselves every specific time span. This even structure, whenever applied at a whole network, leads to several benefits both for users and the company, although some issues are introduced, especially about dimensioning the service. It is therefore fundamental to properly consider the interaction between the transport demand and supply, ...

A novel methodology for the de novo identification of peptides via mixedinteger linear optimization (MILP) and tandem mass spectrometry is presented. The overall mathematical model is presented and the key concepts of the proposed approach are described. A pre-processing algorithm is utilized to identify important m/z values in the tandem mass spectrum. Missing peaks, due to residue-dependent f...

In this paper, based on the cyclic scheduling formulation of Schilling and Pantelides [22], we propose a continuous time mixed integer linear programming (MILP) formulation for the cyclic scheduling of a mixed plant, i.e. a plant composed of batch and continuous tasks. The cycle duration is a variable of the model and the objective is to maximize productivity. By using strengthening techniques ...

This paper considers the primary and secondary path generation problem in traffic engineering. We first present a standard MILP model. Since its size and integrality gap are very large, we then apply a Benders decomposition to isolate the failure case capacity constraints, related linearisation variables and linearisation constraints. The disaggregated Benders cuts are generated, which is actua...

The multiperiod blending problem involves binary variables and bilinear terms, yielding a nonconvex MINLP. In this work we present two major contributions for the global solution of the problem. The first one is an alternative formulation of the problem. This formulation makes use of redundant constraints that improve the MILP relaxation of the MINLP. The second contribution is an algorithm tha...

State-of-the-art baggage handling systems transport luggage in an automated way using destination coded vehicles (DCVs). These vehicles transport the bags at high speeds on a “mini” railway network. In this paper we consider the problem of controlling the route of each DCV in the system. This is a nonlinear, nonconvex, mixed integer optimization problem. Nonlinear model predictive control (MPC)...

Due to the ongoing trend towards increased product variety, fast-moving consumer goods such as food and beverages, pharmaceuticals, and chemicals are typically manufactured through so-called make-and-pack processes. These processes consist of a make stage, a pack stage, and intermediate storage facilities that decouple these two stages. In operations scheduling, complex technological constraint...

for any agency dealing with the design of the water distribution network, an economic design will be an objective. in this research, central force optimization (cfo) and differential evolution (de) algorithm were used to optimize ismail abad water distribution network. optimization of the network has been evaluated by developing an optimization model based on cfo and de algorithm in matlab and ...