The m-machine, n-job, permutation flowshop problem with the total tardiness objective is a common scheduling problem, known to be NP-hard. Branch and bound, the usual approach to finding an optimal solution, experiences difficulty when n exceeds 20. Here, we develop a genetic algorithm, GA,...

In today’s manufacturing outlook, coordinated scheduling of delivery and inventory represents a leading leverage to enhance the competitiveness of firms which aims to address the new challenge coming from scheduling problems. Though in the last decades this kind of issue has been extensively...

A cross-docking terminal enables consolidating and sorting fast-moving products along supply chain networks and reduces warehousing costs and transportation efforts. The target efficiency of such logistic systems results from synchronizing the physical and information flows while scheduling...