| Article ID: | iaor19921012 |
| Country: | Japan |
| Volume: | 35 |
| Issue: | 12 |
| Start Page Number: | 656 |
| End Page Number: | 661 |
| Publication Date: | Dec 1990 |
| Journal: | Communications of the Operations Research Society of Japan |
| Authors: | Tamura Hiroyuki, Ueno Nobuyuki, Nakagawa Yoshiyuki, Tokuyama Hiroyuki, Nakayama Hirotaka |
| Keywords: | production, programming: integer, programming: multiple criteria |
Most production scheduling problems in steel manufacturing are formulated as combinatorial optimization problems with multiple criteria such as production yield, efficiency and lateness. A certain string selection problem, which is the most important scheduling problem in the steel making process, is considered. A string is a sequence of casts, and usually consists of 5-20 orders with the same specification (for example, chemical components) in the steel making process. The aim is to select the most appropriate strings among many alternatives for a production schedule of one week so as to maximize three objective functions. The satisficing trade-off method is applied to this problem, and the effectiveness of the method is discussed. [In Japanese.]