[1] Baker, Kenneth. 1974. Introduction to Sequencing and Scheduling. America :
John Wiley and Son Inc. [2] Laila Rizki Fauziah, Nur Rahma. (2013). Laporan Praktikum Perencanaan Dan Pengendalian Produksi Acara V Penjadwalan Jobshop Dan Flowshop. Laporan Praktikum pada laporan praktikum sistem produksi Universitas Gajah Mada, Yogyakarta. [3] Eko Wicaksono, Farouq (dkk.). (2014). Simulasi Aturan Johnson Untuk Penjadwalan Produksi Flowshop di Perusahaan Furnitur. Dalam Repositori Jurnal Mahasiswa PTIIK UB. [online] Vol 3 (8). Tersedia di: http://ptiik.ub.ac.id/doro/archives/detail/DR00079201406 [1 Februari 2016] [4] Kurniawan Tirtha, Dhany. (2007). Perancangan Program Aplikasi Penjadwalan Produksi Filling Cabinet M Enggunakan Algoritma Smith Pada Pt. Elite Permai Metal Works Ltd. Skripsi pada Universitas Bina Nusantara. Jakarta. [5] Merza Khaliel. (2005). Usulan Penjadwalan Produksi Pada Proses Produksi Flowshop Dengan Metode CDS Dan Branch And Bound di PT. Kabelindo Murni TBK. Skripsi pada Universitas Bina Nusantara. Jakarta. [6] Deepak, dkk. (2012). Constrained Multi-Stage Flowshop Scheduling Including Transportation Time and Weights of Jobs With Break-Down Interval Having Job Block Criteria, the Processing Time Associated with Their Respective Probabilities. Int. Journal of Math. Analysis, Vol. 6, 2012, no. 43, 2133 – 2139. [7] Alharkan, Ibrahim M. (2005). "Algorithms for sequencing and scheduling." Industrial Engineering Department, King Saud University, Riyadh, Saudi Arabia. [8] Faizal, Dkk. Pengembangan Penjadwalan Re-Entrant Flowshop Berdasarkan Algoritma Nawaz, Enscore, Dan Ham (Neh) Dengan Pendekatan Dispatching Rule (Studi Kasus: Pt. Sahabat Rubber Industries - Malang).Jurnal Rekayasa Dan Manajemen Sistem Industri Vol. 2 No. 6 Teknik Industri Universitas Brawijaya. [9] Baker, Kenneth. 1974. Introduction to Sequencing and Scheduling. America : John Wiley and Son Inc. [10] Chandramouli, A.B. 2005. Heuristic Approach For N-Job, 3-Machine Flow Shop Scheduling Problem Involving Transportation Time, Break Down Time And Weights Of Jobs. Mathematical And Computational Applications, Vol. 10, No. 2, Pp. 301-305, 2005. [11] Gupta, Deepak. 2011. Heuristic Approach for n-Jobs, 3-Machines Flow Shop Scheduling Problem, Processing Time Associated With Probabilities Involving Transportation Time, Break-Down Interval, Weightage of Jobs and Job Block Criteria. Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online). Vol.1, No.1, 2011. [12] Xavior M, dkk. 2012. A Simple Model To Optimize General Flow-Shop Scheduling Problems With Known Breakdown Time And Weight Of Jobs. International Conference And Modelling, Optimization, And Computation (ICMOC 2012). [13] Khodadadi , Aboutaleb. 2012. Solving Weighted Flow-Shop Scheduling Problem Involving Break-Down Time of Jobs for Machines. Journal of International Academic Research (2012) Vol.12, No.1.