Single-machine scheduling with deteriorating effects and machine maintenance

Sun, Xinyu; Geng, Xin-Na

doi:10.1080/00207543.2019.1566675

Cited by 45 publications

(2 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Wang et al studied a single machine scheduling problem where deteriorating jobs and flexible periodic maintenance were considered, using a branch and price algorithm [14]. Sun and Geng also aimed to find an optimal schedule in order to minimize the maximum completion time in single machine scheduling [15]. Low et al presented six heuristic algorithms based on first fit and best fit, dealing with single machine scheduling problems with availability constraints to minimize the makespan.…”

Section: Literature Reviementioning

confidence: 99%

An Exact Method and Ant Colony Optimization for Single Machine Scheduling Problem With Time Window Periodic Maintenance

et al. 2020

View full text Add to dashboard Cite

This paper considers a time window periodic maintenance strategy with different duration windows and job scheduling activities in a single machine environment. The aim is to minimize the number of tardy jobs through the integration of production scheduling and periodic maintenance intervals. A mixedinteger linear programming model (MILP) is proposed to optimize small-sized test instances. Furthermore, an ant colony optimization (ACO) algorithm is developed to solve larger sized test instances. Subsequently, to measure the efficiency of the solutions obtained by ACO, Moore's algorithm is also developed to benchmark with ACO. To test the efficiency and the effectiveness of the ACO algorithm, a set of data for small and large sized problems was generated in which several parameters were adopted and then ten replicates were solved for each combination. The small sized instances were solved by the MILP. Then, the results obtained showed that the proposed ACO was able to obtain the exact solutions within reasonable CPU times, thus, it outperformed the CPLEX solver with respect to CPU. The large sized instances were solved by the Moore's algorithm and compared to ACO. Then, the results obtained showed that the ACO outperforms Moore's algorithm for all the instances tested. It can be concluded that the developed ACOis very efficient and effective in solving the problem considered in this paper. INDEX TERMS Scheduling, MILP, single machine, periodic Maintenance, ant colony. AHMED BADWELAN received the B.Sc. degree in mechanical engineering from the Faculty of Engineering, University of Aden, in 2012, and the M.S. degree in industrial engineering from King Saud University, Saudi Arabia. He is currently pursuing the Ph.D. degree with the

show abstract

Section: Literature Reviementioning

confidence: 99%

An Exact Method and Ant Colony Optimization for Single Machine Scheduling Problem With Time Window Periodic Maintenance

et al. 2020

View full text Add to dashboard Cite

show abstract

“…In the real society, processing time of a job (task) is variable due to the deterioration effect and/or controllable processing time (resource allocation). For details on the scheduling problems with deterioration effect (time-dependent processing times), we refer the reader to the recent papers Huang [6], Sun and Geng [19], Huang et al [7], Gawiejnowicz [2], and Qian and Han [17]. The papers about controllable processing times (resource allocation), the reader is referred to articles Shabtay and Steiner [18], Wang and Wang [27], Wang and Wang [26], Lu et al [13], He et al [5], Wang et al [24], Liu and Jiang [10], Lv et al [14], and Zhao [31].…”

mentioning

confidence: 99%

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

An Integrated Artificial Bee Colony Algorithm for Scheduling Jobs and Flexible Maintenance with Learning and Deteriorating Effects

Touafek

Tayeb

Ladj

et al. 2022

Computational Collective Intelligence

View full text Add to dashboard Cite

Single-machine scheduling with deteriorating effects and machine maintenance

Cited by 45 publications

References 40 publications

An Exact Method and Ant Colony Optimization for Single Machine Scheduling Problem With Time Window Periodic Maintenance

An Exact Method and Ant Colony Optimization for Single Machine Scheduling Problem With Time Window Periodic Maintenance

Resource allocation scheduling with deteriorating jobs and position-dependent workloads

An Integrated Artificial Bee Colony Algorithm for Scheduling Jobs and Flexible Maintenance with Learning and Deteriorating Effects

Contact Info

Product

Resources

About