Ten notes on equal-processing-time scheduling

Philippe Baptiste , Peter Brucker , Sigrid Knust , Vadim G. Timkovsky

The paper is published: Quarterly Journal of the Belgian, French and Italian Operations Research Societies (4OR), 2 (2004), 111-127

MSC 2000

90B35 Scheduling theory, deterministic

Abstract
Ten equal-processing-time scheduling problems whose complexity status has been unknown before are shown to be solved in polynomial time by well-known and relatively new techniques. We consider single-machine, parallel-machine, parallel-batch, open-shop, flow-shop, robotic flow-shop and job-shop machine environments.