Minimizing total absolute deviation of job completion times on a single machine with cleaning activities

Su, Ling-Huey; Wang, Huimei

doi:10.1016/j.cie.2016.11.009

Cited by 21 publications

(19 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Preventive maintenance (PM) is one of the factors causing machines to be unavailable for processing jobs, and it can significantly affect the performance of job scheduling. e majority of the studies in the literature assumed that each maintenance activity is either assigned in advance, i.e., its starting and completion times are known, [4][5][6][7][8][9][10][11][12][13][14][15][16] or maintenance activities and jobs are jointly scheduled in the planning horizon [12,[17][18][19][20][21][22][23][24][25][26]. In the abovementioned studies, they assumed that the maintenance time (maintenance duration) is a constant; however, in some maintenance activities such as cleaning, refilling, and recharging, the maintenance time is a nondecreasing function of its starting time, i.e., the later the maintenance activity begins, the longer its duration.…”

Section: Introductionmentioning

confidence: 99%

Improved Approaches to Minimize the Makespan on Single-Machine Scheduling with Periodic Preventive Maintenance Activities

Zhou

Tsai

et al. 2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper addresses a single-machine scheduling problem with periodic preventive maintenance activities that are predeterministic so that the machine is not available all the time, and jobs have to be processed between two consecutive maintenance periods. We propose a mixed integer programming (MIP) model and two heuristics to minimize the makespan. With more constraints in our model, the model is more efficient than the recent model of Perez-Gonzalez and Framinan , and our model could solve problems with up to fifty jobs. Two heuristic algorithms, namely, H (MW) and H (LB∗), are also proposed, in which two bin-packing policies of the minimum waste and minimum lower bound are used, respectively. Furthermore, we also proposed an improvement procedure. The results showed that the heuristic H (MW) outperformed other heuristics of the paper, indicating that the bin-packing policy of the minimum waste is more effective than well-known ones such as full batch and best fit. Additionally, all the heuristic algorithms addressed in this paper combined with the improvement procedure could achieve a similar and high quality of solutions with a very tiny increase in computational expense.

show abstract

Section: Introductionmentioning

confidence: 99%

Improved Approaches to Minimize the Makespan on Single-Machine Scheduling with Periodic Preventive Maintenance Activities

Zhou

Tsai

et al. 2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Ying et al [32] have studied the single-machine scheduling problem with a Common Due Window (CDW) having constant size and position to minimize the total weighted earliness and tardiness penalties in jobs completion. Ling et al [33] minimizing total deviation of job completion time on a single machine scheduling. Dispatching rules have a significant role due to ease of implementation and compatibility with the dynamic nature of manufacturing systems.…”

Section: Scheduling With Dispatching Rulesmentioning

confidence: 99%

Integrated Scheduling of Machines and Agvs in FMS by Using Dispatching Rules

Nageswara¹,

Narayana²,

Janardhana³

2017

J. Prod. Eng.

View full text Add to dashboard Cite

“…Constraint (5) ensures that the former position of each machine has high priority to assign an unscheduled job. Constraint (6) specifies that the available time at one position of one machine should be lager or equal to the release time of the occupied job in the position. Constraint (7) defines that the processing time on one position of one machine.…”

Section: Mixed Integer Programming Modelmentioning

confidence: 99%

“…Xu, Yin, and Li [5] showed that the worst-case performance bound for the heuristic proposed by Chen [4] is 2. Su and Wang [6] investigated a single-machine scheduling problem with clean activities. In their work, the PMs has to be perform to avoid the accumulated dirt in the machine exceed the maximum pre-deterministic threshold, and the objective is to minimize total absolute deviation of job completion times.…”

Section: Introductionmentioning

confidence: 99%

Minimizing the Makespan on Parallel Machines with Flexible Maintenances and Dynamic Release Times of Jobs

Pang¹,

Chou²,

Tsai³

2017

dtssehs

View full text Add to dashboard Cite

Abstract. This paper considers the problem of scheduling n jobs and a number of preventive maintenances (PMs) on parallel machines to minimize the makespan. Each job has a release time, a processing time, and jobs could be continuously processed on the machine as long as the maximum allowed working time is not violated. The maximum allowed working time is given and the PMs are performed periodically once the maximum allowed working time is going to be violated. The problem is NP-hard due to the case of single machine has proven to be NP-hard. For the problem, a mixed integer programming (MIP) model is introduced and optimally solved small-size problems.

show abstract

Minimizing total absolute deviation of job completion times on a single machine with cleaning activities

Cited by 21 publications

References 23 publications

Improved Approaches to Minimize the Makespan on Single-Machine Scheduling with Periodic Preventive Maintenance Activities

Improved Approaches to Minimize the Makespan on Single-Machine Scheduling with Periodic Preventive Maintenance Activities

Integrated Scheduling of Machines and Agvs in FMS by Using Dispatching Rules

Minimizing the Makespan on Parallel Machines with Flexible Maintenances and Dynamic Release Times of Jobs

Contact Info

Product

Resources

About