A job-shop batch scheduling method based on game theory

Author(s):  
Rui Wang ◽  
Guanghui Zhou
2021 ◽  
Vol 11 (11) ◽  
pp. 5107
Author(s):  
Miguel Ortíz-Barrios ◽  
Antonella Petrillo ◽  
Fabio De Felice ◽  
Natalia Jaramillo-Rueda ◽  
Genett Jiménez-Delgado ◽  
...  

Scheduling flexible job-shop systems (FJSS) has become a major challenge for different smart factories due to the high complexity involved in NP-hard problems and the constant need to satisfy customers in real time. A key aspect to be addressed in this particular aim is the adoption of a multi-criteria approach incorporating the current dynamics of smart FJSS. Thus, this paper proposes an integrated and enhanced method of a dispatching algorithm based on fuzzy AHP (FAHP) and TOPSIS. Initially, the two first steps of the dispatching algorithm (identification of eligible operations and machine selection) were implemented. The FAHP and TOPSIS methods were then integrated to underpin the multi-criteria operation selection process. In particular, FAHP was used to calculate the criteria weights under uncertainty, and TOPSIS was later applied to rank the eligible operations. As the fourth step of dispatching the algorithm, the operation with the highest priority was scheduled together with its initial and final time. A case study from the smart apparel industry was employed to validate the effectiveness of the proposed approach. The results evidenced that our approach outperformed the current company’s scheduling method by a median lateness of 3.86 days while prioritizing high-throughput products for earlier delivery.


2021 ◽  
Vol 2021 (0) ◽  
pp. 206
Author(s):  
Kazunori Maruyama ◽  
Takashi Yamazaki ◽  
Masahide Andou ◽  
Shihori Hara ◽  
Daisuke Honami ◽  
...  

2021 ◽  
Vol 1 (2) ◽  
pp. 46-51
Author(s):  
Dwi Ayu Lestari, Vikha Indira Asri

Scheduling is defined as the process of sequencing the manufacture of a product as a whole on several machines. All industries need proper scheduling to manage the allocation of resources so that the production system can run quickly and precisely as of it can produce optimal product. PT. Sari Warna Asli Unit V is one of the companies that implements a make to order production system with the FCFS system. Thus, scheduling the production process at this company is also known as job shop production scheduling. The methods used in this research are the CDS method, the EDD method and the FCFS method. The purpose of this research is to minimize the production time and determine the best method that can be applied to the company. The results of this research showed that the makespan obtained in the company's scheduling system with FCFS rules was 458 minutes, and the results of scheduling using the CDS method obtained a makespan value of 329 minutes, then the best production scheduling method that had the smallest makespan value was the CDS method.


2021 ◽  
Author(s):  
Jing Xu ◽  
Huizhen Pang ◽  
Bingzhe Zhang ◽  
Qixian Li ◽  
Yu Huang

2014 ◽  
Vol 933 ◽  
pp. 708-713 ◽  
Author(s):  
Yuan Huang ◽  
Xiu Tian Yan ◽  
Jing Yao Li

To solve the Dual Resource Constrained Job Shop Dynamic Scheduling Problem with heterogeneous workers (DRCJDSP-HW),a three-tier dynamic scheduling system including dynamic disturbance analysis, dynamic disturbance evaluation and dynamic scheduling method was constructed based on the idea of scheduling with local time window. To minimize the revision of old scheduling scheme in DRCJDSP-HW, a hybrid dynamic scheduling algorithm was proposed based on the chromosome reduction mechanism and the scheduling optimization of local job in stages. The outstanding application effect of the dynamic scheduling system and the hybrid dynamic scheduling algorithm were validated reducing the influence of dynamic disturbances effectively by simulation experiment at last.


2012 ◽  
Vol 263-266 ◽  
pp. 1269-1274
Author(s):  
Dan Chen Zhou ◽  
Liang Zeng

In terms of characteristics of scheduling problem in multi-varieties and small-batch production mode, three additional constraint conditions including combination constraint, priority scheduling and machine load balance are supplemented based on classical Job-shop scheduling model in order to reflect the actual scheduling activities better. An improved genetic annealing algorithm is proposed aiming at the above model, and the requirement of supplemented constraint conditions is satisfied by means of improving the decoding process of chromosomes. The key technologies of algorithm are discussed in detail. The feasibility and validity of the proposed model and algorithm is demonstrated through simulated computation.


Sign in / Sign up

Export Citation Format

Share Document