@Article{BarFeo89a, author = "J.F. Bard and T.A. Feo", title = "Operations sequencing in discrete parts manufacturing", journal = "Management Science", year = "1989", volume = "35", pages = "249--255", annote = "This paper presents a method for efficiently sequencing cutting operations associated with the manufacture of discrete parts. The problem is modeled as an integer program. This is relaxed via Lagrangian relaxation into a min-cut problem on a bipartite network. To obtain lower bounds, a max-flow algorithm is applied and the corresponding solution is input to a {GRASP}.", } @Article{BarFeo91a, author = "J.F. Bard and T.A. Feo", title = "An algorithm for the manufacturing equipment selection problem", journal = "IIE Transactions", volume = "23", pages = "83--92", year = "1991", annote = "This paper provides a unified framework in which product and process demands can be related to manufacturing system requirements. The authors develop a nonlinear cost minimization model. The objective is to determine how many of each machine type to purchase and what fraction of the time each piece of equipment will be configured for a particular type of operation. Once the original problem is converted into a MILP, a depth-first branch \& bound algorithm is used, employing the greedy randomized set covering heuristic of Feo and Resende (1989), to implicitly search for optimality. Viewing the contribution that any machine makes to satisfy the demand of any process as the unit benefit associated with that machine, a benefit-to-cost ratio is computed for each machine. To derive a feasible solution, the heuristic iteratively selects machines with largest ratio and updates benefits to take into account the remaining demand.", } @Article{BarFeoHol96a, AUTHOR = "J.F. Bard and T.A. Feo and S. Holland", TITLE = "A {GRASP} for scheduling printed wiring board assembly", JOURNAL = "I.I.E. Trans.", VOLUME = "28", PAGES = "155--165", year = "1996", annote = "The assembly of printed wiring boards (PWBs) typically involves the coordination of thousands of components and hundreds of part numbers in a job shop environment with more than 50 different processes and workstations. The authors propose a {GRASP} for solving the daily scheduling problem that arises in such environment. The first phase of {GRASP} obtains a user-specified number of schedules. The greedy function is the product between the weighted processing time and and the slack time window.", } @inproceedings{BauSuaMatCom00a, author = "J. Bautista and R. Su\'arez and M. Mateo and R. Companys", title = "Local search heuristics for the assembly line balancing problem with incompatibilities between tasks", booktitle = "Proceedings of the IEEE ICRA-00", volume = "3", city = "San Francisco", month = "April", year = "2000", annote = "The assembly line balancing problem with incompatibilities between tasks consists in minimizing the total number of needed workstations and minimizing the the cycle time for the minimum number of workstations. The authors propose a {GRASP} and a genetic algorithm for solving the problem. The greedy choice favors tasks with the best index value, while the local search phase simply changes the order of elements in the sequence solution.", pages = "2404--2409" } @Article{FeoBar89b, author = "T.A. Feo and J.F. Bard", title = "The cutting path and tool selection problem in computer-aided process planning", journal = "Journal of Manufacturing Systems", year = "1989", volume = "8", pages = "17--26", annote = "The purpose of this paper is to provide a method for minimizing the sum of tool setup and volume removal times associated with metal cutting operations on a flexible machine. The problem is modeled as an integer program, then relaxed into a min-cut problem on a simple network. After obtaining a tentative solution, the authors use a {GRASP} to identify good feasible points corresponding to alternative process plans. These are seen to speed convergence during branch \& bound.", } @Article{FeoBarHol95a, author = "T.A. Feo and J.F Bard and S. Holland", title = "Facility-wide planning and scheduling of printed wiring board assembly", journal = "Operations Research", volume = "43", pages = "219--230", year = "1995", annote = "This paper describes a decision support system known as {INSITES}, designed to assist {Texas Instruments} in the day-to-day assembly operations of their printed wiring board ({PWB}) facilities. A {GRASP} is used to solve the underlying multiple machine scheduling problem. The schedule produced at each {GRASP} iteration is evaluated based on one of five different optimization criteria. The choice of the criterion to be followed is made by the user to rank order the schedules provided by multiple {GRASP} iterations.", } @inproceedings{GarLozSmiGue01a, author = {J.M. Garc\'{\i}a and S. Lozano and K. Smith and F. Guerrero}, title = {{A comparison of {GRASP} and an exact method for solving a production and delivery scheduling problem}}, booktitle = {{First International Workshop on Hybrid Intelligent Systems (HIS'01), Adelaide, Australia}}, month = {December}, annote = {The production and delivery scheduling problem consists in selecting due dated orders to be processed by a manufacturing plant and immediately delivered to the customer. Moreover, a limited number of vehicles are available for delivery. To solve the problem, the authors propose an exact approach and a {GRASP}. The greedy criterion takes into account order weights, while the local search procedure uses an exchange neighborhood.}, year = {2001} } @Article{KliRaj94a, author = "J.G. Klincewicz and A. Rajan", title = "Using {GRASP} to solve the component grouping problem", journal = "Naval Research Logistics", volume = "41", pages = "893--912", year = "1994", annote = "Two new heuristics are proposed for solving a particular set partitioning problem that arises in robotics assembly, as well as in a number of other manufacturing and material logistics application areas. The heuristics are {GRASPs} involving two alternate procedures for determining starting i points: component-based and code-based.", } @Article{RioBar98a, author = "R.Z. R\'{\i}os-Mercado and J.F. Bard", title = "Heuristics for the flow line problem with setup costs", journal = "European Journal of Operational Research", vol = "110", pages = "76--98", year = "1998", annote = "This paper presents two new heuristics for the flowshop scheduling problem with sequence-dependent setup times and makespan minimization objective, one of which is a {GRASP}. Both heuristics are compared to a previously proposed algorithm, based on the traveling salesman problem (TSP), on randomly generated instances. When setup times are an order of magnitude smaller than processing times, the new approaches prove superior to the TSP-based heuristic. When both processing and setup times are identically distributed, the TSP-based heuristic outperforms the proposed procedures.", } @Article{RojBar04a, author = {S. Rojanasoonthon and J.F. Bard}, title = {{A {GRASP} for parallel machine scheduling with time windows}}, journal = {INFORMS Journal on Computing}, volume = {}, pages = {}, annote = {In this paper, the authors extend the {GRASP} they proposed in Rojanasoonthon, Bard, and Reddy (2003) to solve parallel machine scheduling problems in the presence of time windows.}, note = {To appear.}, year = {2004} } @Article{RojBarRed03a, author = {S. Rojanasoonthon and J.F. Bard and S.D. Reddy}, title = {{Algorithms for parallel machine scheduling: A case study of the tracking and data relay satellite system}}, journal = {Journal of the Operational Research Society}, volume = {54}, pages = {806--821}, annote = {In this paper, a {GRASP} is designed, whose greedy criterion in the construction phase is based on maximizing a flexibility function that measures how much slack a schedule has after the insertion is made. Two different neighborhood are considered. The first is defined with respect to relocating scheduled jobs, while the second one with respect to interchanging jobs.}, year = {2003} } @Article{SerCol01a, author = "D. Serra and R. Colom\'e", title = "Consumer choice in competitive location models: {F}ormulations and heuristics", journal = "Papers in Regional Science", volume = "80", pages = "439--464", year = "2001", annote = "This paper studies the importance of customer behavior with respect to distance or transportation costs in the optimality of locations obtained by traditional state-of-the-art competitive location models. The authors propose four models to represent the problem and propose a hybrid metaheuristic for solving it. The proposed method consists of two phases. In the first phase, a good initial solution is found by applying a {GRASP} procedure, while in the second phase the previous solution found is improved by applying a tabu search heuristic.", } @Article{UrbChiRus00a, author = "T.L. Urban and W.-C. Chiang and R.A. Russel", title = "The integrated machine allocation and layout problem", journal = "International Journal of Production Research", volume = "38", pages = "2911--2930", year = "2000", annote = "{GRASP} is used to solve quadratic assignment sub-problems in a model that aggregates quadratic assignment problems with several network flow problems with side constraints. This model is used to produce machine layouts where machines are not required to be placed in a functional or cellular layout.", } @Article{YenCarChaGarNgu00a, author = "J. Yen and M. Carlsson and M. Chang and J.M. Garcia and H. Nguyen", title = "Constraint solving for inkjet print mask design", journal = "Journal of Imaging Science and Technology", volume = "44", pages = "391--397", year = "2000", annote = "Print masks are used to control the firing of the nozzles, that is, to determine which nozzles on an inkjet printer cartridge are to spit an ink droplet at each particular instant in a multiple-pass print mode. Masks are generated by minimizing the total costs. A {GRASP} is proposed for for automatic generation of print masks. It has been used to design the print masks for Hewlett Packard's wide format printers (DeskJet 2500C and 2500CM). This approach can shorten the turn-around time for print mask design.", }