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...

We study the optimal design of a queueing system when agents' arrival and servicing are governed by a general Markov process. The designer of the system chooses entry and exit rules for agents, their service priority---or queueing discipline---as well as their information, while ensuring that...