;Contents: A generalized upper bounding method for doubly coupled linear programs; Nonlinear programming--the choice of direction by gradient projection; Simple stochastic networks: some problems and procedures; A network isolation algorithm; Resource allocation for transportation; Interval estimation of the normal mean subject to restrictions, when the variance is known; The value statement; A queueing process with varying degree of service; MAD: mathematical analysis of downtime; A methodology for estimating expected usage of repair parts with application to parts with no usage history; A stochastic constrained optimal replacement model; A note on the calculation of expected time-weighted backorders over a given interval.
;Contents: Optimal interdiction of a supply network; Optimal multicommodity network flows with resource allocation; On constraint qualifications in nonlinear programming; Inventory systems with imperfect demand information; Contract award analysis by mathematical programming; A finiteness proof for modified Dantzig cuts in integer programming; A solution for queues with instantaneous jockeying and other customer selection rules; The distribution of the product of two noncentral beta variates; Optimum allocation of quantiles in disjoint intervals for the blues of the parameters of exponential distribution when the sample is censored in the middle; Decision rules for equal shortage policies; Systems analysis and planning-programming-budgeting systems (PPBS) for defense decision making; The fast deployment logistic ship project--Economic design and decision technique; Statistical quality control of information; Stochastic duels with lethal dose; A note on a problem of Smirnov--a graph theoretic interpretation.
;Contents: Markov chain analysis of a situation where cannibalization is the only repair activity; Some estimates of reliability using interference theory; The optimal burn-in testing of repairable equipment; Goal programming in econometrics; Production and employment scheduling in multistage production systems; A mutual primal-dual linear programming algorithm; Interception in a network; The fixed charge problem; On computing the expected discounted return in a Markov chain; More ado about economic order quantities (EOQ); The relationship between decision variables and penalty cost parameter in (Q, R) inventory models.
Comprehensive, well-organized volume, suitable for undergraduates, covers theoretical, computational, and applied areas in linear programming. Expanded, updated edition; useful both as a text and as a reference book. 1995 edition.
This is a book on Linear-Fractional Programming (here and in what follows we will refer to it as "LFP"). The field of LFP, largely developed by Hungarian mathematician B. Martos and his associates in the 1960's, is concerned with problems of op timization. LFP problems deal with determining the best possible allo cation of available resources to meet certain specifications. In particular, they may deal with situations where a number of resources, such as people, materials, machines, and land, are available and are to be combined to yield several products. In linear-fractional programming, the goal is to determine a per missible allocation of resources that will maximize or minimize some specific showing, such as profit gained per unit of cost, or cost of unit of product produced, etc. Strictly speaking, linear-fractional programming is a special case of the broader field of Mathematical Programming. LFP deals with that class of mathematical programming problems in which the relations among the variables are linear: the con straint relations (i.e. the restrictions) must be in linear form and the function to be optimized (i.e. the objective function) must be a ratio of two linear functions.
Contents: Control variable methods in the simulation of a model of a multiprogrammed computer system; Models for multi-item continuous review inventory policies subject to constraints; The bottleneck transportation problem; Some remarks on the time transportation problem; Integer points on the Gomory fractional cut (hyperplane); Determining the most vital link in a flow network; Optimal location of a single service center of certain types; Scheduling with earliest start and due date constraints; Large deviation probabilities for order statistics; A bivariate normal theory maximum-likelihood technique when certain variances are known; On the use of standard tables to obtain Dodge-Romig LTPD sampling inspection plans; A model for manpower productivity during organization growth; On models for business failure data; A note of a comparison of confidence interval techniques in truncated life tests.
This book describes the potentialities of metaheuristics for solving production scheduling problems and the relationship between these two fields. For the past several years, there has been an increasing interest in using metaheuristic methods to solve scheduling problems. The main reasons for this are that such problems are generally hard to solve to optimality, as well as the fact that metaheuristics provide very good solutions in a reasonable time. The first part of the book presents eight applications of metaheuristics for solving various mono-objective scheduling problems. The second part is itself split into two, the first section being devoted to five multi-objective problems to which metaheuristics are adapted, while the second tackles various transportation problems related to the organization of production systems. Many real-world applications are presented by the authors, making this an invaluable resource for researchers and students in engineering, economics, mathematics and computer science. Contents 1. An Estimation of Distribution Algorithm for Solving Flow Shop Scheduling Problems with Sequence-dependent Family Setup Times, Mansour Eddaly, Bassem Jarboui, Radhouan Bouabda, Patrick Siarry and Abdelwaheb Rebaï. 2. Genetic Algorithms for Solving Flexible Job Shop Scheduling Problems, Imed Kacem. 3. A Hybrid GRASP-Differential Evolution Algorithm for Solving Flow Shop Scheduling Problems with No-Wait Constraints, Hanen Akrout, Bassem Jarboui, Patrick Siarry and Abdelwaheb Rebaï. 4. A Comparison of Local Search Metaheuristics for a Hierarchical Flow Shop Optimization Problem with Time Lags, Emna Dhouib, Jacques Teghem, Daniel Tuyttens and Taïcir Loukil. 5. Neutrality in Flow Shop Scheduling Problems: Landscape Structure and Local Search, Marie-Eléonore Marmion. 6. Evolutionary Metaheuristic Based on Genetic Algorithm: Application to Hybrid Flow Shop Problem with Availability Constraints, Nadia Chaaben, Racem Mellouli and Faouzi Masmoudi. 7. Models and Methods in Graph Coloration for Various Production Problems, Nicolas Zufferey. 8. Mathematical Programming and Heuristics for Scheduling Problems with Early and Tardy Penalties, Mustapha Ratli, Rachid Benmansour, Rita Macedo, Saïd Hanafi, Christophe Wilbaut. 9. Metaheuristics for Biobjective Flow Shop Scheduling, Matthieu Basseur and Arnaud Liefooghe. 10. Pareto Solution Strategies for the Industrial Car Sequencing Problem, Caroline Gagné, Arnaud Zinflou and Marc Gravel. 11. Multi-Objective Metaheuristics for the Joint Scheduling of Production and Maintenance, Ali Berrichi and Farouk Yalaoui. 12. Optimization via a Genetic Algorithm Parametrizing the AHP Method for Multicriteria Workshop Scheduling, Fouzia Ounnar, Patrick Pujo and Afef Denguir. 13. A Multicriteria Genetic Algorithm for the Resource-constrained Task Scheduling Problem, Olfa Dridi, Saoussen Krichen and Adel Guitouni. 14. Metaheuristics for the Solution of Vehicle Routing Problems in a Dynamic Context, Tienté Hsu, Gilles Gonçalves and Rémy Dupas. 15. Combination of a Metaheuristic and a Simulation Model for the Scheduling of Resource-constrained Transport Activities, Virginie André, Nathalie Grangeon and Sylvie Norre. 16. Vehicle Routing Problems with Scheduling Constraints, Rahma Lahyani, Frédéric Semet and Benoît Trouillet. 17. Metaheuristics for Job Shop Scheduling with Transportation, Qiao Zhang, Hervé Manier, Marie-Ange Manier. About the Authors Bassem Jarboui is Professor at the University of Sfax, Tunisia. Patrick Siarry is Professor at the Laboratoire Images, Signaux et Systèmes Intelligents (LISSI), University of Paris-Est Créteil, France. Jacques Teghem is Professor at the University of Mons, Belgium.
