Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity

Ji, Min; Ge, Jiaojiao; Chen, Ke; Cheng, T.C.E.

doi:10.1016/j.cie.2013.08.020

Cited by 38 publications

(20 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With Lemma 4, the values of k and l can be obtained. In the following we assume k ≤ l and refer to [7] for the other cases.…”

Section: Optimal Solution Algorithmmentioning

confidence: 99%

Single Machine Slack Due-Window Scheduling With Linear Resource Allocation and Position-Dependent Processing Times

Cheng¹,

Li²

2018

Int. J. of Appl. Math.

View full text Add to dashboard Cite

In this paper, we investigate single machine scheduling with linear resource allocation and position-dependent processing times based on the slack due-window method. The objective is to minimize the total cost caused by the due-window location, the due-window size, the resource consumption, the makespan and the earliness and tardiness with respect to a slack due-window. We provide a polynomial-time algorithm to solve the problem.

show abstract

“…With Lemma 4, the values of k and l can be obtained. In the following we assume k ≤ l and refer to [7] for the other cases.…”

Section: Optimal Solution Algorithmmentioning

confidence: 99%

Single Machine Slack Due-Window Scheduling With Linear Resource Allocation and Position-Dependent Processing Times

Cheng¹,

Li²

2018

Int. J. of Appl. Math.

View full text Add to dashboard Cite

show abstract

“…The effect of allocating additional resources on job processing times was also extensively investigated by [8,9,10] and others. A linear function taking the amount of allocated resource as the input parameter was proposed to quantify the effect of additional resources on job processing times.…”

Section: Introductionmentioning

confidence: 99%

“…[12] studied common due-window assignment and scheduling with time-dependent deteriorating jobs and a maintenance activity, and [9,10] investigated the scheduling problem with resource allocation, aging effect and a deteriorating RMA based on common due-window method. [13] considered the slack due-window assignment and scheduling taking into account variable processing-time jobs and a rate-modifying activity.…”

Section: Introductionmentioning

confidence: 99%

Single Machine Slack Due-Window Scheduling With Linear Resource Allocation, Aging Effect, and a Deteriorating Rate-Modifying Activity

Cheng¹,

Li²

2017

Int. J. of Appl. Math.

View full text Add to dashboard Cite

In this paper, we consider the slack due-window method and investigate single machine scheduling with a deteriorating rate-modifying activity, linear resource allocation and aging effect. The objective is to minimize the total cost caused by the due-window location, the due-window size, the earliness and tardiness with respect to a slack due-window, and resource consumption. We provide a polynomial-time algorithm to solve the corresponding problem.

show abstract

“…More recent research with controllable processing time, we can see Su and Lien (2009), Mokhtari, Abadi, and Cheraghalikhani (2011), Karimi-Nasab and Ghomi (2012, Karimi-Nasab et al (2013), and Yang, Cheng, and Yang (2014). For recent papers, considering scheduling problems with due-window and resource allocation, we can refer to Ji et al (2013), and . In practice, machine maintenance procession is not only deteriorating, but also compressible (resource-dependent).…”

Section: Introductionmentioning

confidence: 99%

Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity

Zhu

Zhou

et al. 2015

International Journal of Production Research

View full text Add to dashboard Cite

In this paper, we consider common due-window assignment and scheduling problems with general position-dependent processing times involving deteriorating and compressible maintenance activity on a single machine. Two models associated with maintenance activity are examined in this article, in which the maintenance length is assumed to be either time-dependent and compressible or position-dependent and compressible. The objective is to find jointly the location and size of due-window, position of maintenance as well as resource amount allocated to it, and job sequence to minimise a total cost function based on earliness, tardiness, window location, window size and resource cost. We show that the problem considered in each of the two models' setting can be optimally solved with polynomial time algorithm by reducing to assignment problem. Finally, two examples are provided to illustrate the solution procedures.

show abstract

Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity

Cited by 38 publications

References 43 publications

Single Machine Slack Due-Window Scheduling With Linear Resource Allocation and Position-Dependent Processing Times

Single Machine Slack Due-Window Scheduling With Linear Resource Allocation and Position-Dependent Processing Times

Single Machine Slack Due-Window Scheduling With Linear Resource Allocation, Aging Effect, and a Deteriorating Rate-Modifying Activity

Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity

Contact Info

Product

Resources

About