Single facility scheduling with nonlinear processing times
Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor
Operations Research
The complexity of scheduling starting time dependent tasks with release times
Information Processing Letters
Ant algorithms for discrete optimization
Artificial Life
Three scheduling problems with deteriorating jobs to minimize the total completion time
Information Processing Letters
Computers and Operations Research
Ant Colony Optimization
Single machine group scheduling under decreasing linear deterioration
Journal of Applied Mathematics and Computing
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
Computers and Operations Research
Time-Dependent Scheduling
A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
Computers and Operations Research
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A note on single-processor scheduling with time-dependent execution times
Operations Research Letters
Hi-index | 0.07 |
Recently, machine scheduling problems with deteriorating jobs have received interestingly attention from the scheduling research community. Majority of the research assumed that the actual job processing time is an increasing function of its starting time. However, no job can remain undeteriorated indefinitely in real life situations. This paper considers a single-machine scheduling problem with a truncated linear deteriorating effect and ready times. By the truncated linear deteriorating effect, it means that the actual processing time of a job is a function of its starting time and a control parameter. The objective is to minimize the makespan. A mixed integer programming model and a branch-and-bound algorithm coupled with several dominance properties and two lower bounds are developed to search for the optimal solution. In addition, an ant colony and a Tabu search algorithm where each is refined by the three improvements are also proposed for a near-optimal solution, respectively. A computational experiment is then conducted to evaluate the impacts of the used parameters on the performances of the proposed algorithms.