A sequence list algorithm for the job shop scheduling problem

被引：0
作者：
Zhang, Shuli [1 ]
机构：
[1] School of Software, Harbin University of Science and Technology
来源：
Open Electrical and Electronic Engineering Journal | 2013年 / 7卷 / SPEC ISS 1期
关键词：
Cost function; Job shop scheduling; Sequence list;
D O I：
10.2174/1874129001307010055
中图分类号：
学科分类号：
摘要：
For the discrete manufacturing enterprises, the job shop scheduling problem is an important class of actual combinatorial optimization problem with resources and sequence constraints. According to the needs of the job shop scheduling problem, a sequence list algorithm for the job shop scheduling problem was designed in this paper. In order to make all jobs being finished as soon as possible, the goal of the sequence list algorithm is minimizing the maximal the finish time of all operations. In the sequence list algorithm, two types of sequence lists were built. They are the job sequence lists and the machine sequence lists. A job sequence list was used to store all operations of a job on the basis of its process constraints. A machine sequence list which is null initially was used to store all operations on a machine in accordance with the actual processing order. The important tasks of the sequence list algorithm are inserting all operations of the job sequence lists into the machine sequence lists and adjusting the processing order of the operations in the machine sequence lists. The sequence list algorithm could always achieve a good job shop schedule which ensures the select performance indicators. The feasibility and efficiency of the algorithm was verified through examples. © Shuli Zhang; Licensee Bentham Open.
引用
收藏
页码：55 / 61
页数：6
相关论文
共 10 条
  • [1] Liu S., Zhang S., Wang B., Teng C., Improved virus evolutionary genetic algor ithm for Job-shop scheduling problem, Electr. Mach. Control, 12, 2, pp. 234-238, (2008)
  • [2] Liu S., Zhang S., Wang B., Teng C., Patheno Genetic algorithm for solving job-shop scheduling problem, Comput. Eng., 35, 5, pp. 188-190, (2009)
  • [3] Liu S., Zhang S., Wang B., Teng C., A Job-shop dynamic scheduling algorithm developed by considering uncertain factors, J. Harbin Eng., Uni., 32, 4, pp. 471-475, (2011)
  • [4] Mohammad S.M., Parviz F., Flexible job shop scheduling with tabu search algorithms, Int. J. Adv. Manuf. Technol., 32, 5-6, pp. 563-570, (2007)
  • [5] Atabak E., Maghsud S., Seyda T., Afshin E., A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts, Comput. Ind. Eng., 61, 1, pp. 171-178, (2011)
  • [6] Yahyaoui N., Fnaiech F., A suitable initialization procedure for speeding a neural network job-shop scheduling, IEEE Trans. Ind. Electron., 58, 3, pp. 1052-1060, (2011)
  • [7] Anna L., Advanced scheduling with genetic algorithms in supply networks, J. Manuf. Technol. Manag., 22, 6, pp. 748-769, (2011)
  • [8] Udomsakdigool A., Kachitvichyanukul V., Multiple colony ant algorithm for job-shop scheduling problem, Int. J. Prod. Res., 46, 15, pp. 4155-4175, (2008)
  • [9] Tavakkoli R., Azarkish M., Sadeghnejad A., A new hybrid multi-objective pareto archive PSO algorithm for a bi-objective the job shop scheduling problem, Expert Syst. Appl., 38, 9, pp. 10812-10821, (2011)
  • [10] Ferrer, Susan Heath K., Dew N., An RFID application in large job shop remanufacturing operations, Int. J. Prod. Eco., 133, 2, pp. 612-621, (2011)
1