In this paper, we address an n-job, m-machine permutation flow shop scheduling problem for the objective of minimizing the total flow time. We propose a modification of the best-known method of Framinan and Leisten [An efficient constructive heuristic for flowtime minimization in permutation...

"This book focuses on new developments in computational intelligence in areas such as forecasting, scheduling, production planning, inventory control, and aggregate planning, among others. It provides cutting-edge knowledge on information technology developments for both researchers and...