Production planning and scheduling for an I.C. chip manufacturing plant
Call Number: AIT Thesis no. IE-91-23 Material type:
TextSeries: Asian Institute of Technology. Thesis ; no. IE-91-23Publication details: Bangkok : Asian Institute of Technology, 1991Description: 57, [69] pSubject(s): Online resources: Dissertation note: Thesis (M.Eng.) - Asian Institute of Technology, 1991 Summary: The problem of production planning and scheduling of LC chips production is studied here. The objectives of the study are to develop an efficient procedure that can give maximum production utilization, minimum weighted mean flow time and to computerize the whole process based on the developed procedure. The production planning and scheduling for the month has to be done on a daily basis, under the constraints of limited production capacity, higher demand amounts, different price levels of the products, various production processes and different machine changeover times. The developed procedure consists of three major steps. They are (1) Machine allocation (2) Production Sequencing & (3) Machine Scheduling. Linear integer goal programming is applied to the machine allocation process by utilizing maximum production capacity. The welknown weighted shortest processing time algorithm and McNAUGHTON's heuristic algorithm are applied in the production sequencing and machine scheduling process to get minimum weighted mean flow time. The model is developed in order to suit the special characteristics of the problem. 1 The developed model gives a higher production capacity utilization, and lesser weighted mean flow time than existing method. The developed procedure has been coded in Pascal. So . the whole production planning and scheduling process can be done by one planner by computerized process within an hour. In the existing process four planners are doing manually the whole process using an intuitive procedure. It is a time consuming process. The developed package is so flexible that the user can vary criteria and parameters to suit real conditions.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no. IE-91-23 (Browse shelf(Opens below)) | 1 | Available | 30050003074019 | |||||||||||||
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no. IE-91-23 (Browse shelf(Opens below)) | 2 | Available | 30050003074001 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Thesis no. IE-91-23 (Browse shelf(Opens below)) | Available | 30050160075759 |
A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology
Thesis (M.Eng.) - Asian Institute of Technology, 1991
The problem of production planning and scheduling of LC chips production is studied here. The objectives of the study are to develop an efficient procedure that can give maximum production utilization, minimum weighted mean flow time and to computerize the whole process based on the developed procedure. The production planning and scheduling for the month has to be done on a daily basis, under the constraints of limited production capacity, higher demand amounts, different price levels of the products, various production processes and different machine changeover times. The developed procedure consists of three major steps. They are (1) Machine allocation (2) Production Sequencing & (3) Machine Scheduling. Linear integer goal programming is applied to the machine allocation process by utilizing maximum production capacity. The welknown weighted shortest processing time algorithm and McNAUGHTON's heuristic algorithm are applied in the production sequencing and machine scheduling process to get minimum weighted mean flow time. The model is developed in order to suit the special characteristics of the problem. 1 The developed model gives a higher production capacity utilization, and lesser weighted mean flow time than existing method. The developed procedure has been coded in Pascal. So . the whole production planning and scheduling process can be done by one planner by computerized process within an hour. In the existing process four planners are doing manually the whole process using an intuitive procedure. It is a time consuming process. The developed package is so flexible that the user can vary criteria and parameters to suit real conditions.
There are no comments on this title.

AI Search