Penerapan Non Delay Schedule Dengan Mempertimbangkan Machine Availability Constraint untuk Meminimasi Makespan pada PT Autotech Perkasa Mandiri, Cikarang, Jawa Barat

Anastasia Lidya Maukar, Ineu Widaningsih Sosodoro, Stefanus Setiady


One of the efforts to increase production efficiency is by implementing the right scheduling. PT Autotech Perkasa Mandiri is the job shop production system. Currently implements a heuristic method with a priority dispatch rule, namely the Earliest Due Date (EDD). The EDD rule has the highest priority for the job with the earliest due date to be processed on a machine. This study is to purpose a more optimal scheduling by comparing the makespan of the current schedule with the proposed one. Previous research is the non delay schedule without considering machine availability constraints. In this study, machine availability constraints are taken into account, thus, they are more realistic when applied to the actual problem. The algorithm used is a non delay schedule with working time window (WT-NSA). Machine availability constraints that are taken into account are lunch-break hours (12: 00-13: 00) and shift changes (17: 00-08: 00). From the analysis, it is obtained that makespan from non delay schedule is 23 hours 6 minutes, while makespan from WT-NSA is 26 hours 6 minutes, and makespan from EDD schedule is 38 hours 54 minutes. Non-delay schedule has the smallest makespan, which is 23 hours 6 minutes, but WT-NSA is more realistic when applied to the real problem.


Job Shop, Earliest Due Date, Non Delay Schedule, Machine Availability Constraint, Working Time Window, Makespan.

Full Text:



Baker, K. R. (1974). Introduction to Sequencing and Scheduling, John Wiley, NY.

Baker, K. R. (1995). Element of Sequencing and Scheduling, Kenneth R. Baker, Tuck School of Bussiness Administration, Dartmouth College, Hanover, NH.

Campbell, H. G., Dudek, R. A., and Smith, M. L. (1970). A Heuristic Algorithm for the n Job m Machine Sequencing Problem, Management Science, Vol.16, pp. B630-B637.

Giffler, B., and Thompson, G. L. (1960). Algorithms for Solving Production Scheduling Problems, Operation Research, Vol. 8, pp. 487-503.

Pinedo, M., dan Chao, X.,(1992). A Parametric Adjusment Method for Dispatching, Technical Report, Department of Industrial Engineering adn Operation Research, Columbia University, New York, NY.

Pinedo, M., and Chao, X. (1999). Operations Scheduling with Applications in Manufacturing and Services, Irwin / McGraw-Hill, Burr Ridge, Illinois.

Ploydanai, K., and Mungwattana, A. (2010). Algorithm for Solving Job Shop Scheduling Problem Based on Machine Availability Constraint, Department of Industrial Engineering, Faculty of Engineering, Kasetsart University, Bangkok, Thailand.

Setiady, S. (2016). Usulan Penerapan Non Delay Schedule untuk Meminimasi Makespan di PT Autotech Perkasa Mandiri, Program Studi Teknik Industri, Fakultas Teknik, President University, Cikarang, Indonesia.




  • There are currently no refbacks.

Articles in this journal have been indexed in major research databases, including:

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.