Generate and Test Algorithm Development for Job Scheduling in Parallel Machines Which Considering Setup Time for Minimizing Tardiness and Minimizing Makespan for Alternative Sequences that Have Same Tardiness
| Main Authors: | Suhandi, Victor, Ismanto, Melissa Septina |
|---|---|
| Format: | Proceeding PeerReviewed Book |
| Terbitan: |
, 2014
|
| Subjects: | |
| Online Access: |
http://repository.maranatha.edu/20850/1/Isiem%202014%20a.pdf http://repository.maranatha.edu/20850/ |
Daftar Isi:
- Search for solutions to generate and test algorithm guarantees the optimal value of the desired results. However, the main constraint is the limitaion of element number. Number of input elements may lead to a lot of combinations of alternative solutions, the number may increase exponentially. The application of this algorithm in job scheduling would not be suitable for cases that have a large number of jobs. In this study raised the case of PT Agronesia Inkaba for job scheduling in general press division. Generate and test algorithm can accomodate more than one objective. In this case the main assessment criteria scheduling is total tardiness. If it has the same total tardiness then will compare the makespan. It is quite difficult to be represented using mathematical formulas or using metaheuristic methods. One more thing that increases complexity is the consideration of setup time whne a machine will make a new product or a different product than the one before. The results obtained from the use of generte and test algorithm is optimal and much better than existing heuristic methods. Comparison method used is the method of EDD (Earliest Due Date), Wilkerson Irwin algorithm, Slack methods, and methods of LPT (Longest Processing Time).