Mohamed Ali Rakrouki^1,2,*, Abeer Aljohani¹, Nawaf Alharbe¹, Abdelaziz Berrais², Talel Ladhari²

Intelligent Automation & Soft Computing, Vol.35, No.1, pp. 1119-1134, 2023, DOI:10.32604/iasc.2023.028604 - 06 June 2022

Abstract In this paper, we consider the problem of minimizing the total tardiness in a deterministic two-machine permutation flowshop scheduling problem subject to release dates of jobs and known unavailability periods of machines. The theoretical and practical importance of minimizing tardiness in flowshop scheduling environment has motivated us to investigate and solve this interested two-machine scheduling problem. Methods that solve this important optimality criterion in flowshop environment are mainly heuristics. In fact, despite the -hardness in the strong sense of the studied problem, to the best of our knowledge there are no approximate algorithms (constructive heuristics… More >

Win-Chin Lin^a, Chin-Chia Wu^a, Kejian Yu^b, Yong-Han Zhuang^a, Shang-Chia Liu^c

Intelligent Automation & Soft Computing, Vol.24, No.4, pp. 671-681, 2018, DOI:10.1080/10798587.2017.1302711

Abstract Most research studies on scheduling problems assume that a job visits certain machines only one time. However, this assumption is invalid in some real-life situations. For example, a job may be processed by the same machine more than once in semiconductor wafer manufacturing or in a printed circuit board manufacturing machine. Such a setting is known as the “re-entrant flowshop”. On the other hand, the importance of learning effect present in many practical situations such as machine shop, in different branches of industry and for a variety of corporate activities, in shortening life cycles, and More >