An exact solution method for solving seru scheduling problems with past-sequence-dependent setup time and learning effect

Jiang, Y.; Zhang, Z. ✉; Gong, X.; Yin, Y.

Angol nyelvű Tudományos Szakcikk (Folyóiratcikk)
  • Gazdaságtudományi Doktori Minősítő Bizottság: D nemzetközi
  • SJR Scopus - Computer Science (miscellaneous): D1
Azonosítók
This paper concentrates on three scheduling problems with past-sequence-dependent setup time and DeJong's learning effect in seru production system (SPS), including minimizing the total waiting time, the total absolute differences in waiting time, and the total load. The setup time, which is dependent on the seru and jobs that have been processed, is considered. Also, the actual processing time with DeJong's learning effect is concerned. We propose a general exact solution method to show these three problems can be transformed into assignment problems and can be solved in polynomial time. Finally, the computational experiments are made to validate that the proposed method is promising in solving seru scheduling problems effectively. © 2021 Elsevier Ltd
Hivatkozás stílusok: IEEEACMAPAChicagoHarvardCSLMásolásNyomtatás
2021-10-26 20:55