Tariq Aldowaisan

TL;DR: A comprehensive review of the literature on scheduling problems involving setup times (costs) classifies scheduling problems into batch and non-batch, sequence-independent and sequence-dependent setup, and categorizes the literature according to the shop environments of single machine, parallel machines, flowshops, and job shops.

TL;DR: This paper addresses the m-machine no-wait flowshop scheduling problem to minimize makespan by proposing two heuristics that are based on simulated annealing and Genetic Algorithm techniques and proposing improvement procedures to these heuristic.

TL;DR: In this article, the authors presented several new heuristics for the m-machine no-wait flowshop with total completion time as the criterion and compared them with those of three existing heuristic including a recently developed genetic algorithm.

TL;DR: The computational analysis shows that a small proposed modification (pairwise exchange) improves the error performance of the best existing algorithms almost 50% with negligible CPU time.

TL;DR: This paper addresses the two-machine no-wait flowshop problem where the setup time of a job is separated from its processing time and an elimination criterion is developed and optimal solutions are obtained for two special cases.