Exact solution approaches for the workload smoothing in assembly lines
In this paper, the problem of minimizing the smoothness index for an assembly line given a fixed cycle time and the number of workstations is studied. This problem which is known as the workload smoothing line balancing problem (WSLBP) is a mixed-integer
Derya Dinler, Mustafa Kemal Tural
doaj +1 more source
Developments in linear and integer programming
In this review we describe recent developments in linear and integer (linear) programming. For over 50 years Operational Research practitioners have made use of linear optimisation models to aid decision making and over this period the size of problems ...
Darby-Dowman, K, Wilson, J M
core +1 more source
Optimizing Dynamic Evacuation Using Mixed-Integer Linear Programming
This study presents a new approach to optimize the dynamic evacuation process through a dynamic traffic assignment model formulated using mixed-integer linear programming (MILP).
Hamoud Bin Obaid +4 more
doaj +1 more source
Blocking Orthogonal Designs With Mixed Integer Linear Programming [PDF]
We present a mixed integer linear programming approach to orthogonally block two-level, multilevel, and mixed-level orthogonal designs. The approach involves an exact optimization technique which guarantees an optimal solution. It can be applied to many problems where combinatorial methods for blocking orthogonal designs cannot be used.
Bagus Sartono +2 more
openaire +3 more sources
Production Optimization in a Grain Facility through Mixed-Integer Linear Programming
This article introduces a Mixed-Integer Linear Programming model for cost optimization in multi-product multi-line production scheduling. This model considers discrete time windows and includes realistic constraints. The NP completeness of the problem is
Gabriel Bayá +4 more
doaj +1 more source
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming [PDF]
Mixed-integer programs (MIPs) involving logical implications modeled through big-M coefficients are notoriously among the hardest to solve. In this paper, we propose and analyze computationally an automatic problem reformulation of quite general applicability, aimed at removing the model dependency on the big-M coefficients.
CODATO G, FISCHETTI, MATTEO
openaire +1 more source
A mixed-integer linear programming formulation for the modular layout of three-dimensional connected systems [PDF]
Given the considerable complexity of process plants, there has been a great deal of research focused on aiding the design of plant layout through mathematical optimisation, i.e.
O’Neill, Sam +2 more
core +1 more source
Historical Foundation and Practical Guideline for Ferroelectric Switching Kinetic Studies
The P and U pulses in the conventional PUND measurements are not identical because of the interplay between switching current and the measurement circuit components. This circuit effect can lead to a shift in polarization transients and misinterpreted physics in the switching kinetics.
Yi Liang, Pat Kezer, John T. Heron
wiley +1 more source
Δ-MILP: Deep Space Network Scheduling via Mixed-Integer Linear Programming
This paper introduces $\Delta $ -MILP, a powerful variant of the mixed-integer linear programming (MILP) optimization framework to solve NASA’s Deep Space Network (DSN) scheduling problem. This work is an extension of our original MILP framework (
Thomas Claudet +5 more
doaj +1 more source
Gap inequalities for non-convex mixed-integer quadratic programs [PDF]
Laurent and Poljak introduced a very general class of valid linear inequalities, called gap inequalities, for the max-cut problem. We show that an analogous class of inequalities can be defined for general non-convex mixed-integer quadratic programs ...
Galli, Laura +8 more
core +1 more source

