Paper Info
Title
Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs
Abstract
In this paper we consider a single-machine scheduling problem with simple linear deterioration. By simple linear deterioration, we mean that the processing time of a job is a simple linear function of its execution starting time and its deterioration rate. The objective is to find a schedule that minimizes total absolute differences in waiting times. We show that the optimal schedule is V-shaped: jobs are arranged in descending order of their deterioration rates if they are placed before the job with the smallest deterioration rate, but in ascending order of their deterioration rates if placed after it. We prove other several properties of an optimal schedule, and introduce two efficient heuristic algorithms that are tested against a lower bound. We also provide computational results to evaluate the performance of the heuristic algorithms. Journal of the Operational Research Society (2011) 62, 768-775. doi:10.1057/jors.2010.26 Published online 28 April 2010
Year
DOI
Venue
2011
10.1057/jors.2010.26
JORS
Keywords
Field
DocType
deteriorating jobs,heuristic algorithm,scheduling,single machine,total absolute differences in waiting times,reliability,investment,management science,inventory,forecasting,logistics,information systems,operations research,project management,production,location,communications technology,information technology,computer science,operational research,marketing
Single-machine scheduling,Heuristic,Job shop scheduling,Scheduling (computing),Computer science,Upper and lower bounds,Heuristic (computer science),Execution time,Linear function,Operations management
Journal
Volume
Issue
ISSN
62
4
14769360
Citations 
PageRank 
References 
3
0.43
15
Authors
3
Name
Order
Citations
PageRank
Linhui Sun1534.15
Linyan Sun2967.16
Jibo Wang374541.50