Pengembangan Algoritma Programa Pembatas untuk Penjadwalan Job-Shop

Bobby Kurniawan

Abstract

This research addressed the job-shop scheduling problem in a manufacturing company. The objective is to minimize the makespan. Constraint programming approach is developed to solve the problem. The result obtained from constraint programming is better than that of currently applied by the company. The constraint programming approach is also tested on several randomly generated instances.

Keywords

constraint programming; job shop; makespan; scheduling;

Full Text:

PDF

References

Artigues, C., & Feillet, D. (2008). A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research, 159, 135–-159. Obtenido de https://doi.org/10.1007/s10479-007-0283-0

Beasley, J. E. (2020). OR-Library. OR-Library. Bozejko, W., Gnatowski, A., Pempera, J., & Wodecki, M. (2017, 11). Parallel tabu search for the cyclic job shop scheduling problem. Computers & Industrial Engineering, 113, 512–524. doi:10.1016/j.cie.2017.09.042

Gabteni, S., & Grönkvist, M. (2008, 6). Combining column generation and constraint programming to solve the tail assignment problem. Annals of Operations Research, 171, 61. doi:10.1007/s10479-008-0379-1

Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. (1979, 1). Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. In P. L. Hammer, E. L. Johnson, & B. H. Korte (Eds.). Elsevier. doi:10.1016/S0167-5060(08)70356-X

Huang, S., Tian, N., Wang, Y., & Ji, Z. (2016, 11). An Improved Version of Discrete Particle Swarm Optimization for Flexible Job Shop Scheduling Problem with Fuzzy Processing Time. An Improved Version of Discrete Particle Swarm Optimization for Flexible Job Shop Scheduling Problem with Fuzzy Processing Time, 2016, e5958640. Hindawi. doi:https://doi.org/10.1155/2016/5958640

Kaweegitbundit, P., & Eguchi, T. (2016). Flexible job shop scheduling using genetic algorithm and heuristic rules. Journal of Advanced Mechanical Design, Systems, and Manufacturing, 10, JAMDSM0010-JAMDSM0010. doi:10.1299/jamdsm.2016jamdsm0010

Mehmet, P., Mehmet, A. H., & Mustafa, Y. (1 de 2019). A constraint programming approach to type-2 assembly line balancing problem with assignment restrictions. Assembly Automation, 39, 813–826. Obtenido de https://doi.org/10.1108/AA-12-2018-0262

Mencía, R., Sierra, M. R., Mencía, C., & Varela, R. (2015, 9). Memetic algorithms for the job shop scheduling problem with operators. Applied Soft Computing, 34, 94–105. doi:10.1016/j.asoc.2015.05.004

Peng, Y., Lu, D., & Chen, Y. (2014, 1). A Constraint Programming Method for Advanced Planning and Scheduling System with Multilevel Structured Products. A Constraint Programming Method for Advanced Planning and Scheduling System with Multilevel Structured Products, 2014, e917685. Hindawi. doi:https://doi.org/10.1155/2014/917685

Sellmann, M., Zervoudakis, K., Stamatopoulos, P., & Fahle, T. (2002, 9). Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search. Annals of Operations Research, 115, 207–225. doi:10.1023/A:1021105422248

Taillard, E. (2020). Scheduling instances. Scheduling instances. Zou, X., & Zhang, L. (2020, 1). A constraint programming approach for scheduling repetitive projects with atypical activities considering soft logic. Automation in Construction, 109, 102990. doi:10.1016/j.autcon.2019.102990

DOI: https://doi.org/10.20961/performa.20.1.44302

Refbacks

  • There are currently no refbacks.