TY - GEN
T1 - The Meaning of Permutation in Reentrant Permutation Flow Shop Problems
AU - Segal, Itamar
AU - Grinshpoun, Tal
AU - Ilani, Hagai
AU - Shufan, Elad
N1 - Publisher Copyright:
© 2024 PATAT. All Rights Reserved.
PY - 2024
Y1 - 2024
N2 - In a flow shop, jobs are serially processed on a set of machines, and the machine order is the same for all the jobs. In a permutation flow shop, there is an additional assumption that the order in which jobs enter the machines is the same on each machine. While the meaning of "permutation" is clear for a flow shop, it is more ambiguous for a reentrant flow shop. In a reentrant flow shop, jobs are processed on some machines more than once. Then, there are several ways to understand the meaning of permutation. We indicate that different researchers use the term "permutation" for different assumptions. Our effort is to clear up this ambiguity. This is significant for definition clarity when studying the reentrant scenario. Moreover, the various definitions influence proposed heuristics for solving the problem and, by that, also influence the quality of the resulting solutions. We show this through basic examples as a first step towards more extensive experiments.
AB - In a flow shop, jobs are serially processed on a set of machines, and the machine order is the same for all the jobs. In a permutation flow shop, there is an additional assumption that the order in which jobs enter the machines is the same on each machine. While the meaning of "permutation" is clear for a flow shop, it is more ambiguous for a reentrant flow shop. In a reentrant flow shop, jobs are processed on some machines more than once. Then, there are several ways to understand the meaning of permutation. We indicate that different researchers use the term "permutation" for different assumptions. Our effort is to clear up this ambiguity. This is significant for definition clarity when studying the reentrant scenario. Moreover, the various definitions influence proposed heuristics for solving the problem and, by that, also influence the quality of the resulting solutions. We show this through basic examples as a first step towards more extensive experiments.
KW - Heuristics
KW - Permutation Flow shop
KW - Reentrant Flow Shop
UR - https://www.scopus.com/pages/publications/105023709190
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:105023709190
T3 - Proceedings of the 14th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2024
SP - 99
EP - 109
BT - Proceedings of the 14th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2024
A2 - Ozcan, Ender
A2 - Stidsen, Thomas Jacob Riis
A2 - Chiarandini, Marco
T2 - 14th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2024
Y2 - 27 August 2024 through 30 August 2024
ER -