article

Single machine parallel-batch scheduling with deteriorating jobs

Authors:

Jinjiang YuanAuthors Info & Claims

Theoretical Computer Science, Volume 410, Issue 8-10

Pages 830 - 836

https://doi.org/10.1016/j.tcs.2008.11.009

Published: 01 March 2009 Publication History

Abstract

We consider several single machine parallel-batch scheduling problems in which the processing time of a job is a linear function of its starting time. We give a polynomial-time algorithm for minimizing the maximum cost, an O(n⁵) time algorithm for minimizing the number of tardy jobs, and an O(n²) time algorithm for minimizing the total weighted completion time. Furthermore, we prove that the problem for minimizing the weighted number of tardy jobs is binary NP-hard.

References

[1]

Alidaee, B. and Womer, N.K., Scheduling with time dependent processing times: Review and extensions. Journal of the Operational Research Society. v50. 711-720.

[2]

Bachman, A. and Janiak, A., Minimizing maximum lateness under linear deterioration. European Journal of Operational Research. v126. 557-566.

[3]

Bachman, A., Janiak, A. and Kovalyov, M.Y., Minimizing the total weighted completion time of deteriorating jobs. Information Processing Letters. v81. 81-84.

Digital Library

[4]

Barketau, M.S., Cheng, T.C.E., Ng, C.T., Kotov, V. and Kovalyov, M.Y., Batch scheduling of step deteriorating jobs. Journal of Scheduling. v11. 17-28.

Digital Library

[5]

Browne, S. and Yechiali, U., Scheduling deteriorating jobs on a single processor. Operations Research. v38. 495-498.

Digital Library

[6]

Scheduling a batching machine. Journal of Scheduling. v1. 31-54.

[7]

Chen, Z.L., Parallel machine scheduling with time dependent processing times. Discrete Applied Mathematics. v70. 81-93.

Digital Library

[8]

Cheng, T.C.E. and Ding, Q., Single machine scheduling with step-deteriorating processing times. European Journal of Operational Research. v134. 623-630.

[9]

Cheng, T.C.E., Ding, Q. and Lin, B.M.T., A concise survey of scheduling with timedependent processing times. European Journal of Operational Research. v152. 1-13.

[10]

Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979. Freeman, New York.

Digital Library

[11]

Gupta, J.N.D. and Gupta, S.K., Single facility scheduling with nonlinear processing times. Computer Industrial Engineering. v14. 387-393.

Digital Library

[12]

Kononov, A. and Gawiejnowicz, S., NP-hard cases in scheduling deteriorating jobs on dedicated machines. Journal of the Operational Research Society. v52. 708-717.

[13]

Kunnathur, A.S. and Gupta, S.K., Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. European Journal of Operational Research. v47. 56-64.

[14]

Lee, C.Y., Uzsoy, R. and MartinVega, L.A., Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research. v40. 764-775.

Digital Library

[15]

Lenstra, J.K., Rinnooy Kan, A.H.G. and Brucker, P., Complexity of machine scheduling problems. Annals of Discrete Mathematics. v1. 343-362.

[16]

Mosheiov, G., V-shaped policies for scheduling deteriorating jobs. Operations Research. v39. 979-991.

Digital Library

[17]

Mosheiov, G., Scheduling jobs under simple linear deterioration. Computers and Operations Research. v21. 653-659.

Digital Library

[18]

Potts, C.H. and Kovalyov, M.Y., Scheduling with batching: A review. European Journal of Operational Research. v120. 228-249.

[19]

Sundararaghavan, P.S. and Kunnathur, A.S., Single machine scheduling with start time-dependent processing times: Some solvable cases. European Journal of Operational Research. v78. 394-403.

[20]

Wang, J.B. and Cheng, T.C.E., Scheduling problems with the effects of deterioration and learning. Asia-Pacific Journal of Operational Research. v24 i2. 245-261.

[21]

Wang, J.B., Ng, C.T. and Cheng, T.C.E., Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint. Computers and Operations Research. v35. 2684-2693.

Digital Library

[22]

Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Applied Mathematics and Computation. v180. 185-193.

[23]

Wang, J.B. and Xia, Z.Q., Scheduling jobs under decreasing linear deterioration. Information Processing Letters. v94. 63-69.

Digital Library

[24]

Wang, J.B. and Xia, Z.Q., Flow shop scheduling with deteriorating jobs under dominating machines. Omega. v34. 327-336.

[25]

Yuan, J.J., Qi, X.L., Lu, L.F. and Li, W.H., Single machine unbounded parallel-batch scheduling with forbidden intervals. European Journal of Operational Research. v186. 1212-1217.

Cited By

Kong MLiu XPei JPardalos PMladenovic N(2020)Parallel-batching scheduling with nonlinear processing times on a single and unrelated parallel machinesJournal of Global Optimization10.1007/s10898-018-0705-378:4(693-715)Online publication date: 1-Dec-2020
https://dl.acm.org/doi/10.1007/s10898-018-0705-3
Pei JLiu XPardalos PMigdalas AYang S(2017)Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machineJournal of Global Optimization10.1007/s10898-015-0320-567:1-2(251-262)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1007/s10898-015-0320-5
Miao CZhang YCao Z(2011)Bounded parallel-batch scheduling on single and multi machines for deteriorating jobsInformation Processing Letters10.1016/j.ipl.2011.05.018111:16(798-803)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.1016/j.ipl.2011.05.018
Show More Cited By

Index Terms

Recommendations

Single machine scheduling problems with deteriorating jobs

This paper considers the single machine scheduling problems with deteriorating jobs, i.e. jobs whose processing times are a decreasing linear function of their starting time. It is assumed that jobs have the different basic processing time and same ...
Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs

This paper considers single machine scheduling problems with setup times and deteriorating jobs. The setup times are proportional to the length of the already processed jobs, that is, the setup times are past-sequence-dependent (p-s-d). It is assumed ...
Single-machine batch scheduling of linear deteriorating jobs

We consider the problem of scheduling jobs in batches on a single machine where the processing time of each job is a simple increasing linear function of its waiting time, i.e., the time between the starting time of processing the batch to which the job ...

Comments

Information & Contributors

Information

Published In

cover image Theoretical Computer Science

Theoretical Computer Science Volume 410, Issue 8-10

March, 2009

340 pages

ISSN:0304-3975

Issue’s Table of Contents

Copyright © © 2009.

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 01 March 2009

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kong MLiu XPei JPardalos PMladenovic N(2020)Parallel-batching scheduling with nonlinear processing times on a single and unrelated parallel machinesJournal of Global Optimization10.1007/s10898-018-0705-378:4(693-715)Online publication date: 1-Dec-2020
https://dl.acm.org/doi/10.1007/s10898-018-0705-3
Pei JLiu XPardalos PMigdalas AYang S(2017)Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machineJournal of Global Optimization10.1007/s10898-015-0320-567:1-2(251-262)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1007/s10898-015-0320-5
Miao CZhang YCao Z(2011)Bounded parallel-batch scheduling on single and multi machines for deteriorating jobsInformation Processing Letters10.1016/j.ipl.2011.05.018111:16(798-803)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.1016/j.ipl.2011.05.018
Gawiejnowicz SLin B(2010)Scheduling time-dependent jobs under mixed deteriorationApplied Mathematics and Computation10.1016/j.amc.2010.01.037216:2(438-447)Online publication date: 1-Mar-2010
https://dl.acm.org/doi/10.1016/j.amc.2010.01.037

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents