Two Single Machine Sequencing Problems Involving Controllable Job Processing Times

Vickson, Raymond G.

doi:10.1080/05695558008974515

Cited by 199 publications

(79 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the scheduling literature Vickson [15] was the first to consider controllable processing times. In recent years there has been a growing interest in controllable processing times.…”

Section: Introductionmentioning

confidence: 99%

A strong conic quadratic reformulation for machine-job assignment with controllable processing times

Aktürk

Atamtürk

Gürel

2009

Operations Research Letters

105

145

View full text Add to dashboard Cite

show abstract

“…In the scheduling literature Vickson [15] was the first to consider controllable processing times. In recent years there has been a growing interest in controllable processing times.…”

Section: Introductionmentioning

confidence: 99%

A strong conic quadratic reformulation for machine-job assignment with controllable processing times

Aktürk

Atamtürk

Gürel

2009

Operations Research Letters

105

145

View full text Add to dashboard Cite

show abstract

“…However, in many practical scheduling environments the scheduler can control the job processing times by adjusting the allocation of a common continuously divisible resource to the jobs. Vickson [21] pioneers this line of research. Since then, scheduling with controllable processing times has been thriving in scheduling research (see, e.g., Koulamas et al [10], Ng et al [14], Rudek and Rudek [15], Shabtay et al [16]).…”

Section: Introductionmentioning

confidence: 99%

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

Wang

Yin

Cheng

2017

Naval Research Logistics

View full text Add to dashboard Cite

Abstract:We investigate a single-machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo-polynomial dynamic programming solution algorithms, and provide fully polynomial-time approximation schemes and an enhanced volume algorithm to find high-quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near-optimal solutions.

show abstract

“…The pioneering study initiating the controllable processing times in scheduling is by Vickson (1980). He considered the total processing cost and total weighted completion time on a single machine.…”

Section: Introductionmentioning

confidence: 99%

Optimal allocation and processing time decisions on non-identical parallel CNC machines: ϵ-constraint approach

Gürel

Aktürk

2007

European Journal of Operational Research

View full text Add to dashboard Cite

Two Single Machine Sequencing Problems Involving Controllable Job Processing Times

Cited by 199 publications

References 7 publications

A strong conic quadratic reformulation for machine-job assignment with controllable processing times

A strong conic quadratic reformulation for machine-job assignment with controllable processing times

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

Optimal allocation and processing time decisions on non-identical parallel CNC machines: ϵ-constraint approach

Contact Info

Product

Resources

About