Page 1 Next

Displaying 1 – 20 of 142

Showing per page

A branch&bound algorithm for solving one-dimensional cutting stock problems exactly

Guntram Scheithauer, Johannes Terno (1995)

Applicationes Mathematicae

Many numerical computations reported in the literature show only a small difference between the optimal value of the one-dimensional cutting stock problem (1CSP) and that of the corresponding linear programming relaxation. Moreover, theoretical investigations have proven that this difference is smaller than 2 for a wide range of subproblems of the general 1CSP.

A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem

Odile Bellenguez-Morineau, Emmanuel Néron (2007)

RAIRO - Operations Research

This paper deals with a special case of Project Scheduling problem: there is a project to schedule, which is made up of activities linked by precedence relations. Each activity requires specific skills to be done. Moreover, resources are staff members who master fixed skill(s). Thus, each resource requirement of an activity corresponds to the number of persons doing the corresponding skill that must be assigned to the activity during its whole processing time. We search for an exact solution that...

A DEA model for two-stage parallel-series production processes

Alireza Amirteimoori, Feng Yang (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Data envelopment analysis (DEA) has been widely used to measure the performance of the operational units that convert multiple inputs into multiple outputs. In many real world scenarios, there are systems that have a two-stage network process with shared inputs used in both stages of productions. In this paper, the problem of evaluating the efficiency of a set of specialized and interdependent components that make up a large DMU is considered. In these processes the first stage consists of two parallel...

A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures

Kjetil K. Haugen, Guillaume Lanquepin-Chesnais, Asmund Olstad (2012)


In this paper, we demonstrate the computational consequences of making a simple assumption on production cost structures in capacitated lot-size problems. Our results indicate that our cost assumption of increased productivity over time has dramatic effects on the problem sizes which are solvable. Our experiments indicate that problems with more than 1000 products in more than 1000 time periods may be solved within reasonable time. The Lagrangian decomposition algorithm we use does of course not...

A fuzzy logic approach to assembly line balancing.

Daniel J. Fonseca, C. L. Guest, Matthew Elam, Charles L. Karr (2005)

Mathware and Soft Computing

This paper deals with the use of fuzzy set theory as a viable alternative method for modelling and solving the stochastic assembly line balancing problem. Variability and uncertainty in the assembly line balancing problem has traditionally been modelled through the use of statistical distributions. This may not be feasible in cases where no historical data exists. Fuzzy set theory allows for the consideration of the ambiguity involved in assigning processing and cycle times and the uncertainty contained...

Currently displaying 1 – 20 of 142

Page 1 Next