Total views : 188

Scheduling on a Flexible Job Shop with Setup Operation in IT Manufacturing Fabrication


  • Department of Business Administration, Hanbat National University, Daejeon 34158, Korea, Republic of


Objectives: We consider the scheduling problem in which the separate sequence dependent setup is considered even though a job to be processed is not arrived. Methods/Statistical Analysis: In a flexible job shop considered here, to minimize average flow times and tardiness, heuristic algorithms based on dispatching rules are suggested. A series of computational experiment is done for evaluating the performance of the suggested ones and result shows that they perform better than modified methods in previous researches and a method used in a real situation. Findings: Priority rule based scheduling algorithms and relaxed mixed integer programming for obtaining the initial schedules and improvement procedures are suggested and they give very good solution in a reasonable time so that it can be argued that they are innovative and suitable for the sustainability on the manufacturing firms. This study can be extended to various researches. For example, different types of measurements, such as make span can be used in this problem. Also, one may extend to the large sized problems, i.e., larger number of jobs, operations and machines, for reflecting more real situation. On the other hand, one might need to develop the optimal methodologies such as combinatorial optimization ones. Improvements/ Applications: The suggested methodologies here can be used in IT manufacturing fabrication such as semiconductor and liquid crystal display ones to enhance the ability of production and customer satisfaction.


Flexible Job Shop, Heuristics, IT Manufacturing, Scheduling, Sequence Dependent Setup.

Full Text:

 |  (PDF views: 155)


  • Brucker P, Schlie R. Job-shop scheduling with multi-purpose machines. Computing. 1990; 45(4):369–75.
  • Brandimarte P. Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research. 1993; 41(3):157–83.
  • Kacem I, Hammadi, S, Borne, P. Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transaction Systems, Man, and Cybernetics. 2002; 32(1):1–13.
  • Mati Y, Rezg N, Xie X. An integrated greedy heuristic for a flexible job shop scheduling problem. IEEE International Conference on Systems, Man and Cybernetics. 2001; 4:2534–9.
  • Hurink J, Jurish B, Thole M. Tabu search for the job shop scheduling problem with multi-purpose machines. Operations Research Spectrum. 1994; 15(4):205–15.
  • Yang JB. GA-based discrete dynamic programming approach for scheduling in FMS environments. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics). 2001; 31(5):824–35.
  • Choi IC, Choi DS. A local search algorithm for job-shop scheduling problems with alternatives operations and sequence-dependent setups. Computers and Industrial Engineering. 2002; 42(1):43–58.
  • Zhou Y, Li B, Yang J. Study on job shop scheduling with sequence-dependent setup times using biological immune algorithm. International Journal of Advanced Manufacturing Technology. 2006; 30(1):105–11.
  • Guimaraes KF, Fernandes MA. An approach for flexible job-shop scheduling with separable sequence-dependent setup time. IEEE International Conference on Systems, Man and Cybernetics. 2006; 5:3727–31.
  • Srikanth GU, Maheswari VU, Shanthi AP, Siromoney A. Task scheduling model. Indian Journal of Science and Technology. 2015; 8(7):33–42.
  • Ashwin KSV, Rahul R, Dheepan P, Sendhil KKS. An optimal ant colony algorithm for efficient VM placement. Indian Journal of Science and Technology. 2015; 8(2):156–9.
  • Rishita K. Application of multi-core parallel programming to a combination of ant colony optimization and genetic algorithm. Indian Journal of Science and Technology. 2015; 8(2):138–42.
  • Baker KR, Bertrand JWM. A dynamic priority rule for scheduling against due-dates. Journal of Operations Management. 1982; 3(1):37–42.
  • Caroll CD. Heuristic sequencing of jobs with single and multiple components [PhD thesis]. Cambridge, MA: MIT; 1965.
  • Lee YH, Bhaskaran K, Pinedo M. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions. 1997; 29(1):45–52.
  • Vepsalainen APJ, Morton TE. Priority rules for job shops with weighted tardiness costs. Management Science. 1987; 33(8):1035–47.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.