This paper provides a review of recent results on scheduling with controllable processing
times. The stress is on the methodological aspects that include parametric flow techniques …

This paper provides a review of recent results on machine scheduling problems solved by
methods of submodular optimization. We present some basic definitions of submodular …

This paper addresses the no-wait job shop scheduling problem with due date and
subcontracting cost constraints. For the no-wait job shop problem, it does not allow for …

In this paper we consider a coordinated in-house production scheduling and outsourcing
model, where a manufacturer might outsource part of the production to a subcontractor so as …

In parallel machine scheduling, a size of a job is defined as the number of machines that are
simultaneously required for its processing. This paper considers a scheduling problem in …

In this paper, we study a scheduling problem on a single machine, provided that the jobs
have individual release dates and deadlines, and the processing times are controllable. The …

In scheduling models with controllable processing times, the job processing times can be
controlled (ie compressed) by allocating additional resources. In batch scheduling a large …

In this paper we present a decomposition algorithm for maximizing a linear function over a
submodular polyhedron intersected with a box. Apart from this contribution to submodular …

This paper studied a novel parallel machine rescheduling problem with controllable
processing times under machine breakdown and precedence constraints. This problem is …

In this paper, we propose a new methodology for the speed-scaling problem based on its
link to scheduling with controllable processing times and submodular optimization. It results …