A hybrid Benders approach for coordinated capacitated lot-sizing of multiple product families with set-up times

Bayley, Tiffany
Süral, Haldun
Bookbinder, James H.
We examine a coordinated capacitated lot-sizing problem for multiple product families, where demand is deterministic and time-varying. The problem considers set-up and holding costs, where capacity constraints limit the number of individual item and family set-up times and the amount of production in each period. Using a strong reformulation and relaxing the demand constraints, we improve both the upper and lower bounds using a combination of Benders decomposition and an evolutionary algorithm, followed by subgradient optimisation. Through computational experiments, we show that our method consistently achieves better bounds, reducing the duality gap compared to other single-family methods studied in the literature.


A multicriteria sorting approach based on data envelopment analysis for R&D project selection problem
Karasakal, Esra (Elsevier BV, 2017-12-01)
In this paper, multiple criteria sorting methods based on data envelopment analysis (DEA) are developed to evaluate research and development (R&D) projects. The weight intervals of the criteria are obtained from Interval Analytic Hierarchy Process and employed as the assurance region constraints of models. Based on data envelopment analysis, two threshold estimation models, and five assignment models are developed for sorting. In addition to sorting, these models also provide ranking of the projects. The de...
A visual interactive approach for multiple criteria decision making with monotone utility functions
Köksalan, Mustafa Murat; Rizi, O (Informa UK Limited, 2001-06-01)
We consider the problem of choosing the best of a set of alternatives where each alternative is evaluated on multiple criteria. We develop a visual interactive approach assuming that the decision maker (DM) has a general monotone utility function. The approach partitions the criteria space into nonoverlapping cells. The DM uses various graphical aids to move between cells and to further manipulate selected cells with the goal of creating cells that have ideal points less preferred than an alternative. When ...
Rebalancing the assembly lines with total squared workload and total replacement distance objectives
Girit, Utku; Azizoğlu, Meral (Informa UK Limited, 2020-01-01)
Assembly line balancing is an important and well recognised operations research problem. The current line balance may not stay optimal, even feasible, due to the disruptions in one or more workstations. In this study, after the disruption, we aim to rebalance the assembly line by considering the trade-off between workload balancing (fairness measure) and total replacement distance for the tasks assigned to the different workstations (stability measure). We try to generate all non-dominated objective functio...
A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems
ÖZPEYNİRCİ, SELİN; Azizoğlu, Meral (Informa UK Limited, 2010-05-01)
This study considers the operation assignment and capacity allocation problem in flexible manufacturing systems. A set of operations is selected to be processed and assigned to the machines together with their required tools. The purchase or usage of the required tools incurs a cost. The machines have scarce time and tool magazine capacities. The objective is to maximize the total weight of the assigned operations minus the total tooling costs. We use Lagrangean relaxation approach to obtain upper and lower...
The multi-resource agent bottleneck generalised assignment problem
Karsu, Ozlem; Azizoğlu, Meral (Informa UK Limited, 2012-01-01)
In this study, we consider the multi resource agent bottleneck generalised assignment problem. Our aim is to minimise the maximum load over all agents. We take our motivation from an assignment problem faced in heating, ventilating and air conditioning sector. We study the linear programming (LP) relaxation of the problem. We use the optimal LP relaxation solutions in our branch and bound algorithm while defining bounding and branching schemes. We find that our branch and bound algorithm returns optimal sol...
Citation Formats
T. Bayley, H. Süral, and J. H. Bookbinder, “A hybrid Benders approach for coordinated capacitated lot-sizing of multiple product families with set-up times,” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, pp. 1326–1344, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/46544.