A hybrid dynamic programming for solving a mixed-model sequencing problem with production mix restriction and free interruptions
نویسندگان
چکیده
منابع مشابه
Solving a multi-objective mixed-model assembly line balancing and sequencing problem
This research addresses the mixed-model assembly line (MMAL) by considering various constraints. In MMALs, several types of products which their similarity is so high are made on an assembly line. As a consequence, it is possible to assemble and make several types of products simultaneously without spending any additional time. The proposed multi-objective model considers the balancing and sequ...
متن کاملSolving a Two-Period Cooperative Advertising Problem Using Dynamic Programming
Cooperative advertising is a cost-sharing mechanism in which a part of retailers' advertising investments are financed by the manufacturers. In recent years, investment among advertising options has become a difficult marketing issue. In this paper, the cooperative advertising problem with advertising options is investigated in a two-period horizon in which the market share in the second period...
متن کاملSolving the Mixed Model Sequencing Problem with Workload Minimization with Product Mix Preservation
We propose a hybrid procedure based on Bounded Dynamic Programming assisted by linear programming to solve the Mixed-Model Sequencing Problem with Workload Minimization, with serial workstations, free interruption of the operations and with production mix restrictions. We performed a computational experiment with 7 instances from a case study related to the Nissan Powertrain plant located in Ba...
متن کاملSolving Single Machine Sequencing to Minimize Maximum Lateness Problem Using Mixed Integer Programming
Despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. This paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (MIP) models to solve thisproblem. These models have been formulated for the classical single machine problem, namely sequ...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress in Artificial Intelligence
سال: 2016
ISSN: 2192-6352,2192-6360
DOI: 10.1007/s13748-016-0101-5