A unified analysis for scheduling problems with variable processing times

Wang, Ji‐Bo; Zhang, Bo; He, Hongyu

doi:10.3934/jimo.2021008

Cited by 7 publications

(3 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A future extension is to the group scheduling in the flowshop, parallel machines setting, or two-stage assembly flowshop. Other future research may study extending the group scheduling to scenario-dependent processing times (Wu et al [34][35][36]) or variable processing times (Wang et al [37,38]).…”

Section: Discussionmentioning

confidence: 99%

Study on Single-Machine Group Scheduling with Due-Window Assignment and Position-Dependent Weights

Liu

Wang

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This article considers a single-machine group scheduling problem with due-window assignment, where the jobs are classified into groups and the jobs in the same group must be processed in succession. The goal is to minimize the weighted sum of lateness and due-window assignment cost, where the weights depend on the position in which a job is scheduled (i.e., position-dependent weights). For the common, slack, and different due-window assignment methods, we prove that the problem can be solved polynomially, i.e., in O N log N time, where N is the number of jobs.

show abstract

Section: Discussionmentioning

confidence: 99%

Study on Single-Machine Group Scheduling with Due-Window Assignment and Position-Dependent Weights

Liu

Wang

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Under a convex resource consumption function, they provided a bicriteria analysis for the total weighted flow (completion) time and the total resource consumption cost. Wang et al [28] investigated single-machine resource allocation scheduling with learning and deterioration effects. Under the linear and convex resource consumption functions, they provided unified approaches and showed that four versions of the scheduling cost and total resource consumption cost are solvable in polynomial time.…”

mentioning

confidence: 99%

Resource allocation scheduling with deteriorating jobs and position-dependent workloads

Wang¹,

Lv²,

Wang³

et al. 2023

JIMO

Self Cite

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

“…Under CONW, SLKW, and DIFW assignments, we showed that these problems can be solved in polynomial time. Further extensions are addressing the above problems in the setting of flow shop and identical (unrelated) parallel machines, considering scheduling with resource-dependent processing times (Wang et al [26], and Wang et al [27]), or studying multitasking scheduling (Xiong et al [30]).…”

mentioning

confidence: 99%

Due-window assignment scheduling with learning and deterioration effects

Lin¹

2022

JIMO

View full text Add to dashboard Cite

This paper considers single machine due-window assignment scheduling problems with position-dependent weights. Under the learning and deterioration effects of jobs processing times, our goal is to minimize the weighted sum of earliness-tardiness, starting time of due-window, and due-window size, where the weights only depends on their position in a sequence (i.e., positiondependent weights). Under common due-window (CONW), slack due-window (SLKW) and different due-window (DIFW) assignments, we show that these problems remain polynomial-time solvable.

show abstract

A unified analysis for scheduling problems with variable processing times

Cited by 7 publications

References 35 publications

Study on Single-Machine Group Scheduling with Due-Window Assignment and Position-Dependent Weights

Study on Single-Machine Group Scheduling with Due-Window Assignment and Position-Dependent Weights

Resource allocation scheduling with deteriorating jobs and position-dependent workloads

Due-window assignment scheduling with learning and deterioration effects

Contact Info

Product

Resources

About