.png){kind=icon}
Return
Production planning problem with sequence dependent setups as a bilevel programming problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2006.09.029.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Each of it products is to be processed on two machines in order to satisfy known demands in each of T periods. Only one product can be processed on each machine at any given time. Each switch from one item to another requires sequence dependent setup time. The objective is to minimize the total setup time and the sum of the costs of production, storage and setup. We consider the problem as a bilevel mixed 0-1 integer programming problem. The objective of the leader is to assign the products to the machines in order to minimize the total sequence dependent setup time, while the objective of the follower is to minimize the production, storage and setup cost of the machine. We develop a heuristics based on tabu search for solving the problem. At the end, some computational results are presented. (c) 2006 Elsevier B.V. All rights reserved.
Keywords:
production
two machines
sequence dependent setup times
bilevel mixed 0-1 integer programming problem
heuristics based on tabu search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveUsing tabu search with ranking candidate list to solve production planning problems with setups
PREAI
ShareSave
View more