Article ID Journal Published Year Pages File Type
1133752 Computers & Industrial Engineering 2015 7 Pages PDF
Abstract

•We consider a new scheduling model with a maintenance activity on a single machine.•The maintenance activity must start before a given deadline.•The maintenance duration increases with its starting time.•Polynomial time optimal algorithms are proposed for several classic objectives.

We consider the problem of scheduling a maintenance activity and jobs on a single machine, where the maintenance activity must start before a given deadline and the maintenance duration increases with its starting time. We provide polynomial-time algorithms to solve the problems to minimize the makespan, sum of completion times, maximum lateness, and number of tardy jobs.

Related Topics
Physical Sciences and Engineering Engineering Industrial and Manufacturing Engineering
Authors
, , ,