Green, Paul E.; Krieger, Abba M.
January 1985
Marketing Science;Winter85, Vol. 4 Issue 1, p1
Academic Journal
Recently, a number of articles have appeared in the marketing literature dealing with (single) product design optimization. The present paper represents a start toward extending this research to product line decisions. We first formulate two versions of the problem and describe their various characteristics. Since finding the optimum solution is computationally prohibitive, even for modest size problems, various heuristic approaches are presented and evaluated. Applications involving synthetic and real data are discussed. The paper concludes with comments on related problems and future application areas. (Product; Optimization; Heuristics)


Related Articles

  • A Heuristic Scheduling Policy for Multi-item, Multi-machine Production Systems with Time-varying, Stochastic Demands. Goncalves, Jose F.; Leachman, Robert C.; Gascon, Andre; Xiong, Zhong K. // Management Science;Nov94, Vol. 40 Issue 11, p1455 

    An effective scheduling policy known as the Dynamic Cycle Lengths Heuristic was introduced by Leachman and Gascon in 1988 for the multi-item, single-machine production system facing stochastic, time-varying demands. In this article we develop a heuristic scheduling policy for the multi-machine...

  • AN EVALUATION OF FLOW SHOP SEQUENCING HEURISTICS. Dannenbring, David G. // Management Science;Jul1977, Vol. 23 Issue 11, p1174 

    This paper presents computational experience with eleven flow shop sequencing heuristics. Included in the study are three previously unreported heuristics, one of which turns out to be superior to the other ten heuristics tested. The comparisons were made on a variety of problem sizes, up to...

  • POSITIONING AND PRICING A PRODUCT LINE. Dobson, Gregory; Kalish, Shlomo // Marketing Science;Spring88, Vol. 7 Issue 2, p107 

    A central problem in marketing is: how should a firm position (reposition) and price a line of related (substitute) products in order to maximize profits (or welfare). We formulate this problem faced by a monopolist as a mathematical program, outline how to obtain market data from a sample of...

  • A greedy randomized adaptive search procedure for maximum independent set. Feo, Thomas A.; Resende, Mauricio G. C. // Operations Research;Sep/Oct94, Vol. 42 Issue 5, p860 

    An efficient randomized heuristic for a maximum independent set is presented. The procedure is tested on randomly generated graphs having from 400 to 3,500 vertices and edge probabilities from 0.2 to 0.9. The heuristic can be implemented trivially in parallel and is tested on an MIMD computer...

  • A Heuristic for the Periodic Vehicle Routing Problem. Gaudioso, M.; Paletta, G. // Transportation Science;May92, Vol. 26 Issue 2, p86 

    The paper describes a model for the optimal management of periodic deliveries of a given commodity. The goal is to schedule the deliveries according to feasible combinations of delivery days and to determine the scheduling and routing policies of the vehicles in order to minimize over the...

  • A simulation-optimization heuristic for configuring a selective pallet rack system. Gallego, Mario C. Vé1ez; Ramírez, Diego A. Valencia; Zuluaga, Carlos A. Castro // INGENIARE - Revista Chilena de Ingeniería;2012, Vol. 20 Issue 1, p17 

    A discrete event simulation-optimization heuristic is presented for configuring a selective pallet rack system. To the rack system under study pallets arrive dynamically over time to be stored for a given period of time. The storage duration, arrival time and pallet height are assumed to be...

  • An Efficient Equipment-Layout Algorithm. Neghabat, Farrokh // Operations Research;May/Jun74, Vol. 22 Issue 3, p622 

    This paper treats the problem of locating a given number of interrelated physical facilities in a single- or multi-story building as an optimization model such that the weighted sum of the distances along orthogonal directions is minimized, and describes a constructive heuristic algorithm for...

  • New Greedy-like Heuristics for the Multidimensional 0-1 Knapsack Problem. Loulou, Richard; Michaelides, Eleftherios // Operations Research;Nov/Dec79, Vol. 27 Issue 6, p1101 

    In this paper, we develop tour heuristic methods to obtain approximate solutions to the multidimensional 0-1 knapsack problem. The four methods are tested on a number of problems of various sizes. The solutions are compared to the rigorous optimum as well as to a heuristic method of Toyoda. They...

  • Aplicación de un algoritmo ACO al problema de taller de flujo de permutación con tiempos de preparación dependientes de la secuencia y minimización de makespan. Hornig, Eduardo Salazar; Weber, Natalia Pavón // INGENIARE - Revista Chilena de Ingeniería;may-ago2011, Vol. 19 Issue 2, p253 

    This paper studied the permutation flowshop with sequence dependent setup times and makespan minimization. An ant colony algorithm which turns the original problem into an asymmetric TSP (Traveling Salesman Problem) structure is presented, and applied to problems proposed in the literature and...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics