Schedules with precedence restriction and position-dependent servicing durability
Résumé
We demonstrate that several single machine scheduling problems with positionally dependent processing times can be solved in polynomial time, provided that the graph that defines precedence constraints admit modular decomposition into factors of a bounded width.