A survey of results for sequencing problems with controllable processing times

Nowicki, Eugeniusz; Zdrzałka, Stanisław

doi:10.1016/0166-218x(90)90105-l

Cited by 182 publications

(71 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Scheduling problems with controllable processing times have gained importance in scheduling research since the pioneering works of Vickson [23,24]. For a survey of this area until 1990, the reader is referred to [17]. Recent results include [2,3,4,10,14,15,20,22,26].…”

Section: Introductionmentioning

confidence: 99%

Approximation schemes for job shop scheduling problems with controllable processing times

Jansen

Mastrolilli

Solis-Oba

2005

European Journal of Operational Research

View full text Add to dashboard Cite

In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing times means that it is possible to reduce the processing time of the jobs by paying a certain cost. We consider two models of controllable processing times: continuous and discrete. For both models we present polynomial time approximation schemes when the number of machines and the number of operations per job are fixed.

show abstract

Section: Introductionmentioning

confidence: 99%

Approximation schemes for job shop scheduling problems with controllable processing times

Jansen

Mastrolilli

Solis-Oba

2005

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…4, pp. 724-736, © 2017 been actively studied since the 1980s; see the surveys by Nowicki and Zdrzałka (1990), Shabtay and Steiner (2007). To demonstrate the link between the problems with controllable processing times and the SSP, we give a description of the former model for a machine environment similar to that of SSP.…”

Section: Introductionmentioning

confidence: 99%

Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints

Shioura¹,

Shakhlevich²,

Strusevich³

2017

INFORMS Journal on Computing

View full text Add to dashboard Cite

Abstract. 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 in faster algorithms for traditional speed-scaling models, characterized by a common speed/energy function. Additionally, it efficiently handles the most general models with job-dependent speed/energy functions with single and multiple machines.

show abstract

“…The quality of the resulting schedule is measured with respect to the cost of assigning the actual processing times that guarantee a certain scheduling performance. This area of scheduling has been active since the 1980s, see surveys [21] and [27].…”

Section: Introductionmentioning

confidence: 99%

Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization

Shioura

Shakhlevich

Strusevich

2016

Discrete Optimization and Operations Research

View full text Add to dashboard Cite

Abstract. In this paper, we demonstrate how scheduling problems with controllable processing times can be reformulated as maximization linear programming problems over a submodular polyhedron intersected with a box. We explain a decomposition algorithm for solving the latter problem and discuss its implications for the relevant problems of preemptive scheduling on a single machine and parallel machines.

show abstract

A survey of results for sequencing problems with controllable processing times

Cited by 182 publications

References 15 publications

Approximation schemes for job shop scheduling problems with controllable processing times

Approximation schemes for job shop scheduling problems with controllable processing times

Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints

Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization

Contact Info

Product

Resources

About