Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard

Pre-Emptive Scheduling Problems with Controllable Processing Times

Journal of Scheduling

A survey of scheduling with controllable processing times

Discrete Applied Mathematics

Single-machine scheduling with learning effect and resource-dependent processing times

Computers and Industrial Engineering

Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling

Discrete Applied Mathematics

A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates

Journal of Scheduling

Parallel machine scheduling problem to minimize the makespan with resource dependent processing times

Applied Soft Computing

On several scheduling problems with rejection or discretely compressible processing times

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation

Complexity of a scheduling problem with controllable processing times

Operations Research Letters