作者：Nowicki, E; Smutnicki, C
摘要：A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in a job shop is presented. The algorithm is based on a taboo search technique with a specific neighborhood definition which employs a critical path and blocks of operations notions. Computational experiments (up to 2,000 operations) show that the algorithm not only finds shorter makespans than the best approximation approaches but also runs in shorter time. It solves the well-known 10 x 10 ha...
作者：Federgruen, A; Katalan, Z
作者单位：University of Pennsylvania
摘要：In this paper we discuss stochastic Economic Lot Scheduling Problems (ELSP), i.e., settings where several items need to be produced in a common facility with limited capacity, under significant uncertainty regarding demands, production times, setup times, or combinations thereof. We propose a class of production/inventory strategies for stochastic ELSPs and describe how a strategy which minimizes holding, backlogging, and setup costs within this class can be effectively determined and evaluate...
