Heuristic approach for paper trimming problem | |
| Author | Chaivat Lertcharoensombat |
| Call Number | AIT RSPR no. IE-84-13 |
| Subject(s) | Paper work Heuristic programming |
| Note | A research study submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Abstract | The subject of this research has concerned with decision procedures for solving single machine trimming problem that arises in the paper industry. The objective is t o develop decision procedures tor using in the production scheduling systems. Two suggested decision procedures are presented in this paper. First , an heuristic procedure and some variations are described and empirically investigated by means of an IBM 3031, This procedure is organize d around a sequential search which relies on descriptors or the unscheduled orders to set goals on factors such as trim loss a nd pattern usage for the next pattern to enter the solution. Second, a 'horizontal decomposition linear programming' (HDLP ) procedure which presented by Pierce (19b3) is used with some modification tor application. Results obtained by this procedure are optimal non-integer solution and then be transformed into feasible integer solution by an unreliable procedure. Finally, results obtained by both procedures are compared and summarized to provide a mean f or selecting a good procedure t o solve particular problem. Moreover , such results are also compared with those obtained manually . |
| Year | 1984 |
| Type | Research Study Project Report (RSPR) |
| School | School of Engineering and Technology |
| Department | Department of Industrial Systems Engineering (DISE) |
| Academic Program/FoS | Industrial Engineering (IE) |
| Chairperson(s) | Tabucanon, Mario T. |
| Examination Committee(s) | Fujiwara, Okitsugu ; Vilas Wuwongs |
| Scholarship Donor(s) | The KEIDANREN, Japan |
| Degree | Research Studies Project Report (M. Eng.) - Asian Institute of Technology, 1984 |