Minimising makespan for single burn-in oven scheduling problems using ACO+DP approach

Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey

“…For example, both Refs. [40,41] utilized the ACO to deal with the 1 p − batch, r j , a j , B C max . Hence, it is suggested that a set of benchmark problems could be established so that the performance of different methods can be compared.…”

“…When jobs have unequal release times, a machine could be deliberately left idle as waiting for impending jobs to build fuller batches may bring benefits. The 1 p − batch, r j , a j , B C max was studied in [40][41][42]. Shao and Chen [40] applied an ACO algorithm to generate job sequences and a DP algorithm to form batches, in which the ACO uses information of job processing and release times to update pheromone trails.…”

“…The 1 p − batch, r j , a j , B C max was studied in [40][41][42]. Shao and Chen [40] applied an ACO algorithm to generate job sequences and a DP algorithm to form batches, in which the ACO uses information of job processing and release times to update pheromone trails. By extending the WRB definition, Xu et al [41] defined the waste and idle space (WIS), which includes the waste space from non-identical job sizes or processing times and the idle space from unequal job release times.…”

“…The other exact solution technique is the DP. Shao and Chen tackled the 1 p − batch, r j , a j , B C max with a hybrid method that uses an ACO to generate job sequences and a DP to form batches [40]. Yao et al proposed DP algorithms for the F 2 r j , p − batch → discrete, B, tw j , (incompatible) C max and proved their related time complexity [119].…”

Learning-based adaptive dispatching method for batch processing machines

“…The research on dynamic dispatching includes the composite priority dispatching strategy in feeding control (Wang et al 2007), a hybrid ACO approach for a BPM (Guo et al 2010), dynamic bottleneck dispatching (DBD, Zhang et al 2009), the heuristic dispatching rules forecasting the movement of jobs to reduce waiting time (Solomon et al 2002;Wang 2009), the ACO combining dynamic programming method to minimizing the makespan (Shao 2010), and ACO-based predictive analytics for case-oriented (Lakshmanan et al 2011), dispatching rules considering machines and emergency jobs (Li et al 2011) as well as adaptive learning in scheduling model (Noroozi et al 2013) in the aspect of production line dispatching rules.…”