149
Views
14
CrossRef citations to date
0
Altmetric
Original Articles

Single-machine resource allocation scheduling with due-date assignment, deterioration effect and position-dependent weights

, &
Pages 701-714 | Received 31 Jan 2019, Accepted 28 Mar 2019, Published online: 22 May 2019

References

  • Brucker, P. 2001. Scheduling Algorithms. 3rd ed. Berlin: Springer.
  • Geng, X.-N., J.-B. Wang, and D. Bai. 2018. “Common Due Date Assignment Scheduling for a No-Wait Flowshop with Convex Resource Allocation and Learning Effect.” Engineering Optimization. doi:10.1080/0305215X.2018.1521397
  • Gordon, V. S., J.-M. Proth, and C. Chu. 2002a. “A Survey of the State-of-the-Art of Common Due Date Assignment and Scheduling Research.” European Journal of Operational Research 139: 1–25. doi: 10.1016/S0377-2217(01)00181-3
  • Gordon, V. S., J.-M. Proth, and C. Chu. 2002b. “Due Date Assignment and Scheduling: SLK, TWK and Other Due Date Assignment Models.” Production Planning and Control 13: 117–132. doi: 10.1080/09537280110069621
  • Gordon, V., V. Strusevich, and A. Dolgui. 2012. “Scheduling with Due Date Assignment Under Special Conditions on Job Processing.” Journal of Scheduling 15: 447–456. doi: 10.1007/s10951-011-0240-2
  • Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326. doi: 10.1016/S0167-5060(08)70356-X
  • Hardy, G. H., J. E. Littlewood, and G. Polya. 1967. Inequalities. 2nd ed. Cambridge, UK: Cambridge University Press.
  • Jiang, C., D. Zou, D. Bai, and J.-B. Wang. 2019. “Proportionate Flowshop Scheduling with Position-Dependent Weights.” Engineering Optimization. doi:10.1080/0305215X.2019.1573898
  • Lee, W.-C., Y.-H. Chung, and J.-Y. Wang. 2017. “A Parallel-Machine Scheduling Problem with Two Competing Agents.” Engineering Optimization 49 (6): 962–975. doi: 10.1080/0305215X.2016.1227615
  • Li, L., and J.-J. Wang. 2018. “Scheduling Jobs with Deterioration Effect and Controllable Processing Time.” Neural Computing and Applications 29 (11): 1163–1170. doi: 10.1007/s00521-016-2630-z
  • Liu, W., X. Hu, and X. Wang. 2017. “Single Machine Scheduling with SLACK Due Dates Assignment.” Engineering Optimization 49: 709–717. doi: 10.1080/0305215X.2016.1197611
  • Lu, Y.-Y., J.-B. Wang, P. Ji, and H. He. 2017. “A Note on Resource Allocation Scheduling with Group Technology and Learning Effects on a Single Machine.” Engineering Optimization 49 (9): 1621–1632. doi: 10.1080/0305215X.2016.1265305
  • Nagano, M. S., F. L. Rossi, and N. F. Martarelli. 2019. “High-Performing Heuristics to Minimize Flowtime in No-Idle Permutation Flowshop.” Engineering Optimization 51 (2): 185–198. doi: 10.1080/0305215X.2018.1444163
  • Oron, D. 2014. “Scheduling Controllable Processing Time Jobs in a Deteriorating Environment.” Journal of the Operational Research Society 65: 49–56. doi: 10.1057/jors.2013.5
  • Oron, D. 2016. “Scheduling Controllable Processing Time Jobs with Position-Dependent Workloads.” International Journal of Production Economics 173: 153–160. doi: 10.1016/j.ijpe.2015.12.014
  • Shabtay, D., and G. Steiner. 2007. “A Survey of Scheduling with Controllable Processing Times.” Discrete Applied Mathematics 155 (13): 1643–1666. doi: 10.1016/j.dam.2007.02.003
  • Shabtay, D., and G. Steiner. 2011. “A Bicriteria Approach to Minimize the Total Weighted Number of Tardy Jobs with Convex Controllable Processing Times and Assignable Due Dates.” Journal of Scheduling 14: 455–469. doi: 10.1007/s10951-010-0208-7
  • Sun, L.-H., K. Cui, J.-H. Chen, and J. Wang. 2016. “Due-Date Assignment and Convex Resource Allocation Scheduling with Variable Job Processing Times.” International Journal of Production Research 54: 3551–3560. doi: 10.1080/00207543.2015.1083628
  • Sun, L.-H., C.-C. Ge, W. Zhang, J.-B. Wang, and Y.-Y. Lu. 2018. “Permutation Flow Shop Scheduling with Simple Linear Deterioration.” Engineering Optimization. doi:10.1080/0305215X.2018.1519558
  • Sun, X., X.-N. Geng, J.-B. Wang, and F. Liu. 2019. “Convex Resource Allocation Scheduling in the No-Wait Flowshop with Common Flow Allowance and Learning Effect.” International Journal of Production Research 57: 1873–1891. doi:10.1080/00207543.2018.1510559
  • Tang, L., X. Zhao, J. Liu, and J. Y.-T. Leung. 2017. “Competitive Two-Agent Scheduling with Deteriorating Jobs on a Single Parallel-Batching Machine.” European Journal of Operational Research 263 (2): 401–411. doi: 10.1016/j.ejor.2017.05.019
  • Wang, J.-B., M.-M. Guo, H. Liu, L. Li, and D. Wang. 2016. “Survey on Flow Shop Scheduling Problems with Start Time Dependent Deteriorating Jobs.”Journal of Shenyang Aerospace University 33 (3): 1–10. [In Chinese.]
  • Wang, D., Y. Huo, and P. Ji. 2014. “Single-Machine Group Scheduling with Deteriorating Jobs and Allotted Resource.” Optimization Letters 8 (2): 591–605. doi: 10.1007/s11590-012-0577-2
  • Wang, J.-B., and L. Li. 2018. “Machine Scheduling with Deteriorating Jobs and Modifying Maintenance Activities.” The Computer Journal 61 (1): 47–53. doi: 10.1093/comjnl/bxx032
  • Wang, J.-B., and X.-X. Liang. 2019. “Scheduling with Group Technology, Deteriorating Jobs and Allotted Resource Under Limited Resource Availability Constraint.” Engineering Optimization 51 (2): 231–246. doi: 10.1080/0305215X.2018.1454442
  • Wang, J.-B., M. Liu, N. Yin, and P. Ji. 2017. “Scheduling Jobs with Controllable Processing Time, Truncated Job-Dependent Learning and Deterioration Effects.” Journal of Industrial and Management Optimization 13 (2): 1025–1039. doi: 10.3934/jimo.2016060
  • Wang, J.-B., and M.-Z. Wang. 2012. “Single-Machine Scheduling to Minimize Total Convex Resource Consumption with a Constraint on Total Weighted Flow Time.” Computers & Operations Research 39: 492–497. doi: 10.1016/j.cor.2011.05.026
  • Wang, J.-B., and M.-Z. Wang. 2013a. “Minimizing Makespan in Three-Machine Flow Shops with Deteriorating Jobs.” Computers & Operations Research 40 (2): 547–557. doi: 10.1016/j.cor.2012.08.006
  • Wang, X.-R., and J.-J. Wang. 2013b. “Single-Machine Scheduling with Convex Resource Dependent Processing Times and Deteriorating Jobs.” Applied Mathematical Modelling 37: 2388–2393. doi: 10.1016/j.apm.2012.05.025
  • Wang, X.-Y., and J.-J. Wang. 2013c. “Single-Machine Due Date Assignment Problem with Deteriorating Jobs and Resource-Dependent Processing Times.” International Journal of Advanced Manufacturing Technology 67: 255–260. doi: 10.1007/s00170-013-4771-x
  • Wang, J.-B., and J.-J. Wang. 2014. “Single Machine Group Scheduling with Time Dependent Processing Times and Ready Times.” Information Sciences 275 (1): 226–231. doi: 10.1016/j.ins.2014.02.034
  • Wang, J.-B., and J.-J. Wang. 2015. “Single-Machine Scheduling Problems with Precedence Constraints and Simple Linear Deterioration.” Applied Mathematical Modelling 39 (3-4): 1172–1182. doi: 10.1016/j.apm.2014.07.028
  • Wang, D.-J., Y. Yin, and T. C. E. Cheng. 2017. “A Bicriterion Approach to Common Flow Allowances Due Window Assignment and Scheduling with Controllable Processing Times.” Naval Research Logistics 64 (1): 41–63. doi: 10.1002/nav.21731
  • Wang, J.-B., B. Zhang, L. Li, D. Bai, and Y.-B. Feng. 2019. “Due Window Assignment Scheduling Problems with Position-Dependent Weights on a Single Machine.” Engineering Optimization. doi:10.1080/0305215X.2019.1577411
  • Wang, J.-B., and B.-L. Zhao. 2017. “Research on Single-Machine Group Scheduling with Independent Setup Times and Deterioration Effect.” Journal of Shenyang Aerospace University 34 (4): 82–87. [In Chinese.]
  • Wang, X.-Y., Z. Zhou, P. Ji, and J.-B. Wang. 2014. “Parallel Machines Scheduling with Simple Linear Job Deterioration and Non-Simultaneous Machine Available Times.” Computers & Industrial Engineering 74 (1): 88–91. doi: 10.1016/j.cie.2014.05.003
  • Xiong, X., D. Wang, T. C. E. Cheng, C.-C. Wu, and Y. Yin. 2018. “Single-Machine Scheduling and Common Due Date Assignment with Potential Machine Disruption.” International Journal of Production Research 56 (3): 1345–1360. doi: 10.1080/00207543.2017.1346317
  • Yang, S.-J., H.-T. Lee, and J.-Y. Guo. 2013. “Multiple Common Due Dates Assignment and Scheduling Problems with Resource Allocation and General Position-Dependent Deterioration Effect.” International Journal of Advanced Manufacturing Technology 67: 181–188. doi: 10.1007/s00170-013-4763-x
  • Yin, Y., T. C. E. Cheng, C.-C. Wu, and S.-R. Cheng. 2013. “Single-Machine Common Due-Date Scheduling with Batch Delivery Costs and Resource-Dependent Processing Times.” International Journal of Production Research 51: 5083–5099. doi: 10.1080/00207543.2013.793424
  • Yin, Y., Y. Wang, T. C. E. Cheng, W. Liu, and J. Li. 2017. “Parallel-Machine Scheduling of Deteriorating Jobs with Potential Machine Disruptions.” Omega 69: 17–28. doi: 10.1016/j.omega.2016.07.006
  • Yin, Y., D.-J. Wang, T. C. E. Cheng, and C.-C. Wu. 2016a. “Bi-Criterion Single-Machine Scheduling and Due-Window Assignment with Common Flow Allowances and Resource-Dependent Processing Times.” Journal of the Operational Research Society 67 (9): 1169–1183. doi: 10.1057/jors.2016.14
  • Yin, Y., D.-J. Wang, C.-C. Wu, and T. C. E. Cheng. 2016b. “CON/SLK Due Date Assignment and Scheduling on a Single Machine with Two Agents.” Naval Research Logistics 63 (5): 416–429. doi: 10.1002/nav.21700
  • Yin, Y., Y. Yang, D.-J. Wang, T. C. E. Cheng, and C.-C. Wu. 2018. “Integrated Production, Inventory, and Batch Delivery Scheduling with Due Date Assignment and Two Competing Agents.” Naval Research Logistics 65 (5): 393–409. doi: 10.1002/nav.21813

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.