We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m =2...

Advanced Planning and Scheduling (APS) systems have gained renewed interest from academics and practitioners. However, literature on APS adoption is scant. This study explores the impact of organizational and innovation related factors on the adoption of APS systems from a factors approach. The...