74
Views
7
CrossRef citations to date
0
Altmetric
Original Articles

Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs

&
Pages 1938-1943 | Received 11 Jul 2018, Accepted 19 Nov 2018, Published online: 18 Jan 2019

References

  • Alidaee, B., and N. K. Womer. 1999. “Scheduling with Time Dependent Processing Times: Review and Extensions.” Journal of the Operational Research Society 50: 711–720. doi: 10.1057/palgrave.jors.2600740
  • Browne, S., and U. Yechiali. 1990. “Scheduling Deteriorating Jobs on a Single Processor.” Operations Research 38 (3): 495–498. doi:10.1287/opre.38.3.495.
  • Chen, Z. L. 1995. “A Note on Single-Processor Scheduling with Time-Dependent Execution Times.” Operations Research Letters 17: 127–129. doi: 10.1016/0167-6377(94)00058-E
  • Cheng, T. C. E., Q. Ding, and B. M. T. Liu. 2004. “A Concise Survey of Scheduling with Time-Dependent Processing Times.” European Journal of Operational Research 152 (1): 1–13. doi: 10.1016/S0377-2217(02)00909-8
  • Gawiejnowicz, S. 2008. Time-Dependent Scheduling. Berlin: Springer.
  • Gupta, J. N. D., and S. K. Gupta. 1988. “Single Facility Scheduling with Nonlinear Processing Times.” Computers & Industrial Engineering 14 (4): 387–393. doi: 10.1016/0360-8352(88)90041-1
  • Kononov, A. 1998. “Single Machine Scheduling Problems with Processing Times Proportional to an Arbitrary Function.” Discrete Analysis and Operations Research 5: 17–37. [In Russian].
  • Li, S. S., and R. X. Chen. 2017. “Common Due Date Assignment and Cumulative Deterioration Scheduling on a Single Machine.” Engineering Optimization 49: 976–989. doi: 10.1080/0305215X.2016.1227616
  • Mosheiov, G. 1994. “Scheduling Jobs Under Simple Linear Deterioration.” Computers and Operations Research 21: 653–659. doi: 10.1016/0305-0548(94)90080-9
  • Pinedo, M. 2008. Scheduling: Theory, Algorithms, and Systems. Upper Saddle River, NJ: Prentice-Hall.
  • Wang, J. B., and X. X. Liang. 2018. “Group Scheduling with Deteriorating Jobs and Allotted Resource Under Limited Resource Availability Constraint.” Engineering Optimization 51 (2): 231–246. doi:10.1080/0305215X.2018.1454442.
  • Woeginger, G. J. 1995. “Scheduling with Time-Dependent Execution Times.” Information Processing Letters 54: 155–156. doi: 10.1016/0020-0190(95)00011-Z
  • Woeginger, G. J. 2000. “When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?” INFORMS Journal on Computing 12: 57–74. doi: 10.1287/ijoc.12.1.57.11901
  • Yin, Y. Q., T. C. E. Cheng, L. Wan, C. C. Wu, and J. Liu. 2015a. “Two-Agent Single-Machine Scheduling with Deteriorating Jobs.” Computers and Industrial Engineering 81: 177–185. doi: 10.1016/j.cie.2015.01.002
  • Yin, Y. Q., W. H. Wu, T. C. E. Cheng, and C. C. Wu. 2014. “Due Date Assignment and Single-Machine Scheduling with Generalized Positional Deteriorating Jobs and Deteriorating Multi-Maintenance Activities.” International Journal of Production Research 52: 2311–2326. doi: 10.1080/00207543.2013.855833
  • Yin, Y. Q., W. H. Wu, T. C. E. Cheng, and C. C. Wu. 2015b. “Single-Machine Scheduling with Time-Dependent and Position-Dependent Deteriorating Jobs.” International Journal of Computer Integrated Manufacturing 28: 781–790. doi: 10.1080/0951192X.2014.900872
  • Zhang, X. G., W. C. Lin, W. H. Wu, and C. C. Wu. 2017. “Single-Machine Common/Slack Due Window Assignment Problems with Linear Decreasing Processing Times.” Engineering Optimization 49: 1388–1400. doi: 10.1080/0305215X.2016.1248180
  • Zhao, C. L. 2017. “An FPTAS for the Weighted Number of Tardy Jobs Minimization on a Single Machine with Deteriorating Jobs.” Journal of Industrial and Management Optimization 13: 587–592.
  • Zhao, C. L., C. J. Hsu, S. R. Cheng, Y. Q. Yin, and C. C. Wu. 2014. “Due Date Assignment and Single Machine Scheduling with Deteriorating Jobs to Minimize the Weighted Number of Tardy Jobs.” Applied Mathematics and Computation 248: 503–510. doi: 10.1016/j.amc.2014.09.095

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.