Three scheduling problems with deteriorating jobs to minimize the total completion time
Information Processing Letters
Information Processing Letters
Scheduling linear deteriorating jobs with an availability constraint on a single machine
Theoretical Computer Science
Computers & Mathematics with Applications
Time-Dependent Scheduling
Two-machine flow shop problem with effects of deterioration and learning
Computers and Industrial Engineering
Single-machine scheduling problems with deteriorating jobs and learning effects
Computers and Industrial Engineering
Single-machine scheduling with learning effect and deteriorating jobs
Computers and Industrial Engineering
Experience-based approach to scheduling problems with the learning effect
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Some scheduling problems with deteriorating jobs and learning effects
Computers and Industrial Engineering
Single machine scheduling with time-dependent deterioration and exponential learning effect
Computers and Industrial Engineering
Computers and Operations Research
A survey of scheduling with deterministic machine availability constraints
Computers and Industrial Engineering
Computers & Mathematics with Applications
Computers and Industrial Engineering
Hi-index | 0.00 |
Maintenance is important to manufacturing process as it helps improve the efficiency of production. Although different models of joint deterioration and learning effects have been studied extensively in various areas, it has rarely been studied in the context of scheduling with maintenance activities. This paper considers scheduling with jointly the deterioration and learning effects and multi-maintenance activities on a single-machine setting. We assume that the machine may have several maintenance activities to improve its production efficiency during the scheduling horizon, and the duration of each maintenance activity depends on the running time of the machine. The objectives are to determine the optimal maintenance frequencies, the optimal maintenance locations, and the optimal job schedule such that the makespan and the total completion time are minimized, respectively, when the upper bound of the maintenance frequencies on the machine is known in advance. We show that all the problems studied can be solved by polynomial time algorithms.