An overview of heuristic solution methods
From MaRDI portal
Publication:4661242
DOI10.1057/palgrave.jors.2601758zbMath1203.90184OpenAlexW2068614448MaRDI QIDQ4661242
Publication date: 4 April 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601758
Related Items (19)
A computational approach to enhancing course timetabling with integer programming ⋮ Heuristics for solving disassemble-to-order problems with stochastic yields ⋮ Energy-oriented scheduling based on evolutionary algorithms ⋮ MILP-based heuristics for the design of rural community electrification projects ⋮ An evolutionary algorithm and discrete event simulation for optimizing inspection strategies for multi-stage processes ⋮ APPLYING SIMULATED ANNEALING TO A GENERALIZED CELL FORMATION PROBLEM CONSIDERING ALTERNATIVE ROUTINGS AND MACHINE RELIABILITY ⋮ Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ Controlling lead times and minor ordering costs in the joint replenishment problem with stochastic demands under the class of cyclic policies ⋮ Inventory Management: An Overview, Canadian Publications, Practical Applications and Suggestions for Future Research ⋮ A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG ⋮ Inventory control of raw materials under stochastic and seasonal lead times ⋮ On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ Cost analysis of the unloader queueing system with a single unloader subject to breakdown with two types of trailers ⋮ An extension of the stochastic joint-replenishment problem under the class of cyclic policies ⋮ Unnamed Item ⋮ Approximated closed-form minimum-cost solution to the \((r, q)\) policy with complete backordering and further developments ⋮ Computing lower and upper bounds for a large-scale industrial job shop scheduling problem ⋮ Allocation of advertising space by a web service provider using combinatorial auctions
This page was built for publication: An overview of heuristic solution methods
