A Sequence List Algorithm For The Job Shop Scheduling Problem

Shuli Zhang
2013 Open Electrical & Electronic Engineering Journal  
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
more » ... he 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.
doi:10.2174/1874129001307010055 fatcat:or4prjss2nbj3csmhtp3vkdbre