Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine
We consider single machine scheduling problems with learning/deterioration effects and time-dependent processing times, with due date assignment consideration, and our objective is to minimize the weighted number of tardy jobs. By reducing all versions of the problem to an assignment problem, we sol...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2013/972358 |
id |
doaj-5193ab345bbb455f81f93fa79ed005d9 |
---|---|
record_format |
Article |
spelling |
doaj-5193ab345bbb455f81f93fa79ed005d92020-11-25T00:15:19ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472013-01-01201310.1155/2013/972358972358Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single MachineJianbo Qian0George Steiner1Operations Management Area, DeGroote School of Business, McMaster University, Hamilton, ON, L8S 4L8, CanadaOperations Management Area, DeGroote School of Business, McMaster University, Hamilton, ON, L8S 4L8, CanadaWe consider single machine scheduling problems with learning/deterioration effects and time-dependent processing times, with due date assignment consideration, and our objective is to minimize the weighted number of tardy jobs. By reducing all versions of the problem to an assignment problem, we solve them in O(n4) time. For some important special cases, the time complexity can be improved to be O(n2) using dynamic programming techniques.http://dx.doi.org/10.1155/2013/972358 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Jianbo Qian George Steiner |
spellingShingle |
Jianbo Qian George Steiner Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine Mathematical Problems in Engineering |
author_facet |
Jianbo Qian George Steiner |
author_sort |
Jianbo Qian |
title |
Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine |
title_short |
Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine |
title_full |
Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine |
title_fullStr |
Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine |
title_full_unstemmed |
Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine |
title_sort |
scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine |
publisher |
Hindawi Limited |
series |
Mathematical Problems in Engineering |
issn |
1024-123X 1563-5147 |
publishDate |
2013-01-01 |
description |
We consider single machine scheduling problems with learning/deterioration effects and time-dependent processing times, with due date assignment consideration, and our objective is to minimize the weighted number of tardy jobs. By reducing all versions of the problem to an assignment problem, we solve them in O(n4) time. For some important special cases, the time complexity can be improved to be O(n2) using dynamic programming techniques. |
url |
http://dx.doi.org/10.1155/2013/972358 |
work_keys_str_mv |
AT jianboqian schedulingwithlearningeffectsandortimedependentprocessingtimestominimizetheweightednumberoftardyjobsonasinglemachine AT georgesteiner schedulingwithlearningeffectsandortimedependentprocessingtimestominimizetheweightednumberoftardyjobsonasinglemachine |
_version_ |
1725387588502552576 |