Integrated Problem for Lot Sizing and Flexible Flow Shop Scheduling Problem in the Tobacco Industry Considering Setup times and Cigarette Quality

CHAI Jianbin1 LIU He2,3 BEI Xiaoqiang4

(1.Guanghua School of Management, Peking University, Beijing, China 100871)
(2.Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China 100190)
(3.University of Chinese Academy of Sciences, Beijing, China 100049)
(4.School of Economics and Management, Tsinghua University, Beijing, China 100084)
【Knowledge Link】genetic algorithm

【Abstract】On the basis of integrated problem for lot sizing and flexible flow shop scheduling problem in the tobacco industry, a mixed integer linear model is formulated to optimize the lot sizing and scheduling problem whose objective consists of four parts: the production time, the setup times, the cigarette quality and inventory cost. Given the NP-hard, a genetic algorithm is designed to solve this problem based on monolithic method. The infeasible solutions are reduced through the design of genetic operator. Numerical examples are conducted based on the operation data of a cigarette corporation. The result shows great advantage in decreasing setup times over the previous scheduling plan, which proves the feasibility and validity of our model and algorithm. The algorithm can be well verified in making scheduling decisions for the production of cigarette of real company.

【Keywords】 capacitated lot sizing problem; flexible flow shop scheduling; GA; maximum completion time; setup times;


Download this article


    [1] LIN HP, FAN YS, WU C. Research of Integrated Planning and Scheduling Based on Hierarchy Scheduling Model [J]. Computer Integrated Manufacturing Systems, 2002, 8 (8): 602–606 (in Chinese).

    [2] Karimi B, Ghomi S M T F, Wilson J M. The capacitated lot sizing problem: a review of models and algorithms [J]. Omega, 2003, 31 (5): 365–378.

    [3] HAN Y, TANG JF, MOU LF, PAN ZD. Particle Swarm Optimization Algorithm for Solving Uncapacitated Multilevel Lot-sizing Problems [J]. Journal of Management Sciences in China, 2008, 11 (5): 33–40 (in Chinese).

    [4] Bitran G R, Yanasse H H. Computational complexity of the capacitated lot size problem [J]. Management Science, 1982, 28 (10): 1174–1186.

    [5] Graves S C. A review of production scheduling [J]. Operations Research, 1981, 29 (4): 646–675.

    [6] Luh G C, Chueh C H. A multi-modal immune algorithm for the job-shop scheduling problem [J]. Information Sciences, 2009, 179 (10): 1516–1532.

    [7] LI L, HUO JZ. Multi-objective Flexible Job-shop Scheduling Problem in Steel Tubes Production [J]. Systems Engineering—Theory & Practice, 2009, 29 (8): 117–126 (in Chinese).

    [8] SONG LB, XU XJ, SUN YM, ZHA L. A Hybrid Genetic Algorithm for Flexible Job Shop Scheduling Problem [J]. Journal of Management Sciences in China, 2010, 13 (11): 49–54 (in Chinese).

    [9] Zhang R, Wu C. A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective [J]. Computers & Operations Research, 2011, 38 (5): 854–867.

    [10] Nguyen S, Zhang M, Johnston M, Tan K C. A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem [J]. Evolutionary Computation, IEEE Transactions on, 2013, 17 (5): 621–39.

    [11] Nguyen S, Zhang M, Johnston M, Tan K.C. Automatic design of scheduling policies for dynamic multi-objective job shop scheduling via cooperative coevolution genetic programming [J]. Evolutionary Computation, IEEE Transactions on, 2014, 18 (2): 193–208.

    [12] HUANG XW, MA XL, CAO DB. Improved Generic Algorithm for Job-shop Scheduling Problem with Process Sequence Flexibility [J]. Operations Research and Management Science, 2013, 22 (1): 65–70 (in Chinese).

    [13] SONG JW, TANG JF. No-wait Hybrid Flow Shop Scheduling Method Based on Discrete Particle Swarm Optimization [J]. Journal of System Simulation, 2010 (10): 2257–2261 (in Chinese).

    [14] Jolai F, Asefi H, Rabiee M, Ramezani P. Bi-objective simulated annealing approaches for no-wait two-stage flexible flow shop scheduling problem [J]. Scientia Iranica, 2013, 20 (3): 861- 872.

    [15] ZHANG QL, CHEN YS. Hybrid PSO-NEH Algorithm for Solving No-wait Flexible Flow Shop Scheduling Problem [J]. Systems Engineering—Theory & Practice, 2014 (3): 802–809 (in Chinese).

    [16] Rabiee M, Rad R S, Mazinani M, Shafaei R. An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines [J]. The International Journal of Advanced Manufacturing Technology, 2014, 71 (5- 8): 1229–1245.

    [17] Karthikeyan S, Asokan P, Nickolas S, Page T. A hybrid discrete firefly algorithm for solving multi-objective flexible job shop scheduling problems [J]. International Journal of Bio-Inspired Computation, 2015, 7 (6): 386–401.

    [18] Huang R H, Yang C L, Liu S C. No-wait flexible flow shop scheduling with due windows [J]. Mathematical Problems in Engineering, 2015, 2015. 1–9.

    [19] Ramezani P, Rabiee M, Jolai F. No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approach [J]. Journal of Intelligent Manufacturing, 2015, 26 (4): 731–744.

    [20] ZHOU H, TAN XW. Integrated Model for Two-stage Production Planning and Its Genetic Algorithm Design [J]. Journal of System Simulation, 2007, 19 (16): 3643–3649 (in Chinese).

    [21] Maravelias C T, Sung C. Integration of production planning and scheduling: overview, challenges and opportunities [J]. Computers & Chemical Engineering, 2009, 33 (12): 1919–1930.

    [22] Meyr H. Simultaneous lotsizing and scheduling on parallel machines [J]. European Journal of Operational Research, 2002, 139 (2): 277–292.

    [23] AN YW, YAN HS. Integrated Optimization for Production Planning and Scheduling in a Two-stage Production System [J]. Computer Integrated Manufacturing System, 2012, 18 (4): 796–806 (in Chinese).

    [24] Ramezanian R, Saidi-Mehrabad M, Teimoury E. A mathematical model for integrating lot-sizing and scheduling problem in capacitated flow shop environments [J]. The International Journal of Advanced Manufacturing Technology, 2013. 1–15.

    [25] Wolosewicz C, Dauzère-Pérès S, Aggoune R. A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem [J]. European Journal of Operational Research, 2015, 244 (1): 3–12.

    [26] Nicholls M G. An integer programming approach to short-term production scheduling in a tobacco plant [J]. Journal of the Operational Research Society, 1998. 1117–1129.

    [27] Pattloch M, Schmidt G, Kovalyov M Y. Heuristic algorithms for lotsize scheduling with application in the tobacco industry [J]. Computers & industrial engineering, 2001, 39 (3): 235–253.

    [28] WANG AM, DING L, NING RX, LI JS. Tobacco packaging Job-Shop dynamic scheduling technology [J]. Computer Integrated Manufacturing Systems, 2010, 16 (3): 603–610 (in Chinese).

    [29] XU YQ, ZHANG SS, LV XS. Design of Production and Scheduling System for Tobacco [J]. Computer Systems & Applications, 2013 (7): 72–76 (in Chinese).

    [30] JIN J, JIN Z, QI YD. Cigarette production scheduling modeling and optimization [J]. Computer Engineering and Applications, 2013, 49 (18): 253–259 (in Chinese).

    [31] Gupta J N D. Two-stage, hybrid flowshop scheduling problem [J]. Journal of the Operational Research Society, 1988, 39 (4): 359–364.

    [32] TANG GC. Theory of Modern Scheduling [M]. Shanghai Popular Science Press, 2003 (in Chinese).

    [33] XU JP. Multiple Objective Decision Making Theory and Methods [M]. Tsinghua University Press, 2005 (in Chinese).

    [34] Gen M, Cheng R. Genetic algorithms and engineering optimization [M]. John Wiley & Sons, 2000.

    [35] YANG HH, Wu ZM, WANG XQ. The Research on GA Approach to Capacitated Lot Sizing Planning Problem [J]. Systems Engineering, 2001, 19 (6): 39–44 (in Chinese).

    [36] Srinivas M, Patnaik L M. Adaptive probabilities of crossover and mutation in genetic algorithms [J]. IEEE Transactions on Systems Man & Cybernetics, 1994, 24 (4): 656–667.

    [37] ZHANG TN, HAN B, YU B. Flexible job-shop scheduling optimization based on improved genetic algorithm [J]. Systems Engineering—Theory & Practice, 2011, 31 (3): 505–511 (in Chinese).

This Article



Vol 28, No. 10, Pages 165-174

October 2019


Article Outline



  • 0 Introduction
  • 1 Problem description
  • 2 Mathematical modeling
  • 3 GA
  • 4 Analysis of examples
  • 5 Conclusions
  • References