Ten notes on equal-processing-time scheduling: At the frontiers of solvability in polynomial time

Abstract

Equal-processing-time scheduling problems whose complexity status has been unknown are shown to be solved in polynomial time by well-known and relatively new techniques. Single-machine, parallel-machine, parallel-batch, openshop, flow-shop and job-shop environments are touched upon. © Springer-Verlag 2004.