I have developed "tennis elbow" from lugging this book around the past four weeks, but it is worth the pain, the effort, and the aspirin. It is also worth the (relatively speaking) bargain price. Including appendixes, this book contains 894 pages of text. The entire panorama of the neural sciences is surveyed and examined, and it is comprehensive in its scope, from genomes to social behaviors. The editors explicitly state that the book is designed as "an introductory text for students of biology, behavior, and medicine," but it is hard to imagine any audience, interested in any fragment of neuroscience at any level of sophistication, that would not enjoy this book. The editors have done a masterful job of weaving together the biologic, the behavioral, and the clinical sciences into a single tapestry in which everyone from the molecular biologist to the practicing psychiatrist can find and appreciate his or

Principles of Neural Science

https://minerva-access.unimelb.edu.au/bitstream/handle/11343/118668/Multi-critea decision_24.pdf

Multi-criteria decision making approaches for supplier evaluation and selection: A literature review

https://isiarticles.com/bundles/Article/pre/pdf/19101.pdf

A review of methods supporting supplier selection

https://www.icesi.edu.co/blogs/semillerosi3/files/2013/12/3-SUPPLY-CHAIN-MANAGEMENT-A-ANALYTICAL-FRAMEWORK-FOR-CRITICAL-LITERATURE-REVIEW.pdf

Supply chain management: an analytical framework for critical literature review

Since the original Data Envelopment Analysis (DEA) study by Charnes et al. [Measuring the efficiency of decision-making units. European Journal of Operational Research 1978;2(6):429–44], there has been rapid and continuous growth in the field. As a result, a considerable amount of published research has appeared, with a significant portion focused on DEA applications of efficiency and productivity in both public and private sector activities. While several bibliographic collections have been reported, a comprehensive listing and analysis of DEA research covering its first 30 years of history is not available. This paper thus presents an extensive, if not nearly complete, listing of DEA research covering theoretical developments as well as “real-world” applications from inception to the year 2007. A listing of the most utilized/relevant journals, a keyword analysis, and selected statistics are presented.

Evaluation of research in efficiency and productivity:a survey and analysis of the first 30 years of scholarly literature in DEA

The textbook Dantzig-Wolfe decomposition for the Capacitated Lot Sizing Problem (CLSP), as already proposed by Manne in 1958, has an important structural deficiency. Imposing integrality constraints on the variables in the full blown master will not necessarily give the optimal IP solution as only production plans which satisfy the Wagner-Whitin condition can be selected. It is well known that the optimal solution to a capacitated lot sizing problem will not necessarily have this Wagner-Whitin property. The columns of the traditional decomposition model include both the integer set up and continuous production quantity decisions. Choosing a specific set up schedule implies also taking the associated WagnerWhitin production quantities. We propose the correct Dantzig-Wolfe decomposition reformulation separating the set up and production decisions. This formulation gives the same lower bound as Manne’s reformulation and allows for branch-and-price. We use the Capacitated Lot Sizing Problem with Set Up Times to illustrate our approach. Computational experiments are presented on data sets available from the literature. Column generation is speeded up by a combination of simplex and subgradient optimization for finding the dual prices. The results show that branch-and-price is computationally tractable and competitive with other approaches. Finally, we briefly discuss how this new Dantzig-Wolfe reformulation can be generalized to other mixed integer programming problems, whereas in the literature, branch-and-price algorithms are almost exclusively developed for pure integer programming problems. 5001-6182 Business 5201-5982 Business Science Library of Congress Classification (LCC) QA 1-939 Mathematics M Business Administration and Business Economics M 11 R 4 Production Management Transportation Systems Journal of Economic Literature (JEL) C 61 Programming models 85 A Business General 260 K 240 B Logistics Information Systems Management European Business Schools Library Group (EBSLG) 250 A Mathematics Gemeenschappelijke Onderwerpsontsluiting (GOO) 85.00 Bedrijfskunde, Organisatiekunde: algemeen 85.34 85.20 Logistiek management Bestuurlijke informatie, informatieverzorging Classification GOO 31.80 Toepassingen van de wiskunde Bedrijfskunde / Bedrijfseconomie Bedrijfsprocessen, logistiek, management informatiesystemen

A New Dantzig-Wolfe Reformulation And Branch-And- Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times

A TIRE PRODUCTION SCHEDULING SYSTEM FOR SOLIDEAL Zeger Degraeve Raf Jans Solideal is an international industrial tire manufacturer. The tires are built in molds and are produced in heaters in large series production runs. Some tires can be cured in two different types of heaters. Preparing a heater for a specific tire type requires a set up which typically only takes place during the morning shift. Therefore, the company employs to a discrete production policy. The resulting scheduling problem is a capacitated, multi-item lot sizing problem with set up times and multiple non-identical alternative machines. The objective is the minimization of the total costs for set up, backlog and inventory. Management opted for a fast algorithm that could produce various alternative high quality solutions. The problem is solved using a column generation scheme where the master is solved approximately using Lagrange relaxation. During the column generation process, various heuristic integer solutions are created from which the schedulers can then choose one to implement. We present computational results on real life data with up to 30 products and 30 periods.

https://lirias.kuleuven.be/bitstream/123456789/102873/1/OR_0005.pdf

A tire production scheduling system for Solideal

Voor vele ondernemingen maken de externe aankopen het belangrijlste deel van de totale kosten uit. Bovendien blijkt outsourcing steeds meer aan belang te winnen. Toch bemerken we, zowel in de wetenschappelijke literatuur als in de praktijlc, dat weinig aandacht geschonken wordt aan accurate en objectieve methodes om leveranciers te selecteren. In deze bijdrage stellen we een beslissingsmodel voor dat toelaat leveranciers te selecteren op basis van total cost of ownership informatie. Het mathematisch programmeringsmodel laat toe te bepalen welke hoeveelheid van welke producten op welk moment bij welke leverancier dient aangekocht te worden zodat de total cost of ownership wordt geminimaliseerd, gegeven de relevante beperkingen. Het model houdt rekening met de lcostenstructuur van de aankopende onderneming en de specijieke prestaties van de verschillende mogelijke leveranciers. Implementaties bij Cockerill Sambre tonen een gemiddelde vermindering in total cost of ownership van bijna 10 %.

Een algemeen beslissingsondersteunend systeem voor strategisch aankoopbeleid gebaseerd op total cost of ownership informatie

There appear to be two versions of the Dual Bin Packing problem in the literature. In addition, one of the versions has a counterpart in the cutting stock literature, known as the Skiving Stock Problem. This paper outlines branch-andprice algorithms for both. We introduce combinatorial upper bounds and well-performing heuristics from the literature in the branch-and-price framework. Extensive computational tests indicate that the branch-and-price approach is superior to the existing branch-and-bound procedures, based on combinatorial bounds. The tests illustrate the influence of different problem characteristics on the computation time and the limits of the branch-and-price approach. � 2004 Elsevier B.V. All rights reserved.

Discrete Optimization Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem

In this report a new fast time domain approach for the identification of ATM-traffic is proposed. The traffic is measured and characterised by its first and second order statistic moments. A Markov Modulated Poisson Process (MMPP) is used to capture the information in these two statistic moments. Since the identification of a general MMPP is time consuming because of the large computational requirements, a circulant MMPP is used to reduce the computational cost. A circulant MMPP is an MMPP with a circulant transition matrix. The main advantages of this approach are the avoidance of inverse eigenvalue problem and the decoupling of the two statistic moments. Since ATM-traffic is highly correlated one can expect slowly decaying autocorrelations, which slows down the time domain identification. Therefore the autocorrelation is rewritten as a sum of exponentials using subspace-identification for stochastic linear time invariant systems. The identification of the second order statistics is decoupled from the first order statistics and uses 0/1 knapsack solvers and unconstrained optimisation.

Zeger Degraeve

Papers

A New Dantzig-Wolfe Reformulation And Branch-And- Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times

A tire production scheduling system for Solideal

Een algemeen beslissingsondersteunend systeem voor strategisch aankoopbeleid gebaseerd op total cost of ownership informatie

Discrete Optimization Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem

Discrete stochastic modelling of ATM-traffic with circulant transition matrices