A note on resource allocation scheduling with position-dependent workloads

Lu, Yuanyuan; Liu, Jiayu

doi:10.1080/0305215x.2017.1414207

Cited by 20 publications

(7 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The classical assignment and scheduling problem with common due-window on single machine was first introduced by [15], and since then studied in numerous papers as evident by the survey of Janiak et al [11]. Based on preceding papers, [11] propose that "There is a variety of applications of due window scheduling models in JIT manufacturing, (18)…”

Section: Problem Pz2mentioning

confidence: 99%

A unified approach for single machine scheduling with position-dependent workloads and positional penalties

Mor

2020

SN Appl. Sci.

View full text Add to dashboard Cite

In this paper, we provide unified methods for solving scheduling problems with convex resource allocation, concentrating on objective functions that can be expressed as a scalar product of the actual processing times vector and a job-independent and position-dependent penalties vector. We assume general position-dependent workloads, i.e., the workloads are not restricted to be either monotone functions of the job positions or to specific functions. The first unified method focuses on minimizing a scheduling measure subject to a constraint on the resource consumption, whereas the second addresses the complementary problem of minimizing the consumed resource given an upper bound on the scheduling measure. For each unified approach, we provide a methodical analysis and consequently provide a O n 3 solution algorithm. Furthermore, to demonstrate the unified schemes, we solve several scheduling measures that involve earliness and tardiness penalties.

show abstract

Section: Problem Pz2mentioning

confidence: 99%

A unified approach for single machine scheduling with position-dependent workloads and positional penalties

Mor

2020

SN Appl. Sci.

View full text Add to dashboard Cite

show abstract

“…Recent papers on scheduling problems with CPT (RA) include in Shabtay and Steiner (2007), Ji et al. (2015), Oron (2016), Lu and Liu (2018), Fleszar and Hindi (2018), and Wang and Li (2019).…”

Section: Introductionmentioning

confidence: 99%

Bicriterion scheduling with truncated learning effects and convex controllable processing times

Wang

et al. 2020

Int Trans Operational Res

View full text Add to dashboard Cite

This paper investigates single-machine scheduling in which the processing time of a job is a function of its position in a sequence, a truncation parameter, and its resource allocation. For a convex resource consumption function, we provide a bicriteria analysis where the first is to minimize total weighted flow (completion) time, and the second is to minimize total resource consumption cost. If the weights are positional-dependent weights, we prove that three versions of considering the two criteria can be solved in polynomial time, respectively. If the weights are job-dependent weights, the computational complexity of the three versions of the two criteria remains an open question. To solve the problems with job-dependent weights, we present a heuristic (an upper bound) and a branch-and-bound algorithm (an exact solution).

show abstract

“…be solved in polynomial time. Oron [16] and Lu and Liu [12] studied position-dependent workloads model: the actual processing time of job J j is p j,r (u j ) = wj,r uj η , where w j,r is the workload of job J j if scheduled in position r. Oron [16] proved that the problem 1 p j,r (u j ) = wj,r uj η , n j=1 u j ≤ Û V can be solved in polynomial time, where V ∈ {C max , n j=1 C j , T ADC, T ADW }. Lu and Liu [12] proved that the problems 1 p j,r (u j ) = wj,r uj…”

mentioning

confidence: 99%

“…n j=1 v j u j can be solved in polynomial time respectively, where V ∈ {C max , n j=1 C j , T ADC, T ADW }, V, n j=1 v j u j denotes the Pareto-optimal solutions V, n j=1 v j u j (see T'kindt and Billaut [20], Lu and Liu [12]). Wang et al [22] investigated the resource allocation single machine scheduling problems with job rejection and rate-modifying activity.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Resource allocation scheduling with deteriorating jobs and position-dependent workloads

Wang¹,

Lv²,

Wang³

et al. 2023

JIMO

View full text Add to dashboard Cite

<p style='text-indent:20px;'>In this study, we consider the resource allocation scheduling with a deterioration effect and position-dependent workloads concurrently on a single machine. The scheduler needs to find the optimal sequence and the optimal resource allocation such that a cost function is minimized. First, the focus is on minimizing the linear weighted sum of the schedule cost and resource consumption cost. Second problem is to minimize the schedule cost subject to an upper bound on the resource consumption cost. Third problem is to minimize the resource consumption cost subject to an upper bound on the schedule cost. Last problem is to find Pareto-optimal solutions for schedule cost and resource consumption cost. We proved that these problems remain polynomially solvable respectively.</p>

show abstract

A note on resource allocation scheduling with position-dependent workloads

Cited by 20 publications

References 40 publications

A unified approach for single machine scheduling with position-dependent workloads and positional penalties

A unified approach for single machine scheduling with position-dependent workloads and positional penalties

Bicriterion scheduling with truncated learning effects and convex controllable processing times

Resource allocation scheduling with deteriorating jobs and position-dependent workloads

Contact Info

Product

Resources

About