Ceria Farela Mada Tantrika


Abstract Adi Bungsu (AB) Cigarette Company produces Clove Cigarette in four stages. Each stage is processed by one machine. Thus, the production line is described as flowshop. AB receive order from customer over country. Every month, AB should schedule the order from customer. Thus, AB should prioritize which order to be processed firstly. At this time, AB schedules their order by using First Come First Serve algorithm which prioritize the first order as the first processed job. Previously, this algorithm results in tardiness and high work-in-process. Therefore, this study aims to reduce the tardiness and work-in-process level. In this study, the scheduling problem is solved by using mixed integer programming. To minimize tardiness and work-in-process simultaneously, the objective include minimizing total tardiness and total flowtime. Meanwhile, this study also consider setup time separated from processing time so that setup can be done early while waiting job to be processed in previous stage. The results of this study show that mixed integer programming with two-criteria can be used to schedule job ordered by customer. In case of bicriteria scheduling problem with separated setup time, mixed integer programming generate better schedule than FCFS algorithm.


Flowshop Scheduling; Lowtime; Mixed Integer Programming; Separated Setup Times; Tardiness

Full Text:



Vollman, Thomas E. 1998,Manufacturing Planning and Control Systems for Supply Chain Management, McGraw-Hill.

Baker, Kenneth R. 1974, Introduction to sequencing and Schedulling, New York: Wiley’s.

Kusuma, Hendra. 2001,Manajemen Produksi: Perencanaan dan Pengendalian Produksi, Yogyakarta: Penerbit Andi.

Eren, Tamer dan Güner, Ertan. 2006, A Bicriteria Flowshop Scheduling Problem with Setup Times,Applied Mathematics and Computation, Vol. 183, pp. 1292-1300.

Allahverdi, Ali. 2003, The Two- and mMachine Flowshop Scheduling Problems with Bicriteria of Makespan and Mean Flowtime,European Journal of Operational Research, Vol. 147 No. 2, pp. 373-396.

Yagmahan, Betul dan Yenisey, Mehmet Mutlu. 2007. Ant colony optimization for multi-objective flow shop scheduling problem,Computers & Industrial Engineering, doi:10.1016/j.cie.2007.08.003.

Varadharajan, T.K. dan Rajendran, Chandrasekharan. 2005. A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs,European Journal of Operational Research,Vol. 167, pp. 772–795.

Allahverdi, Ali dan Al-Anzi, Fawaz S. 2006. A branch-and-bound algorithm for three- machine flowshop scheduling problem to minimize total completion time with separate setup times,European

Journal of Operational Research, Vol. 169, pp. 767–780.

Yokoyama, Masao. 2008. Flow-shop scheduling with setup and assembly operations,European Journal of Operational Research, Vol. 187, pp. 1184–1195.



  • There are currently no refbacks.

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