MODEL PENJADWALAN PADA SISTEM PRODUKSI SHOFDENGAN KENDALA INTERVAL KETIDAKTERSEDIAAN MESIN

• Main Author: Agus Arlianto, Jerry
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/1743
• Institution: Institut Teknologi Bandung

The majority of the scheduling literature assumes that machines are available all the time. However, this assumption may not be applicable in real world, since a machine may be unavailable during certain periods of time when, for instance, the machine breakdowns or a <br /> preventive maintenance activity is scheduled. <br /> In this thesis, we study m machine flow shop problems with due date constrains. The problem conciders that an unavailability interval occurs only at one of m machines. Since in the planning horizon for the shop floor scheduling is usually not too long, it is reasonable to assume that there is only one unavailable interval. <br /> We assume that if a job cannot be completed before the next unavailable period of a machine then the job will have to restart when <br /> the machine has become available again, it is called nonresumable conditions. We propose algoritms to solve the problem, and use some <br /> hipotetic cases to test the solutions. The resulting solutions are compared to the solutions obtained from the complete enumeration method and the comparisons show that the solutions are optimal.