162
Views
8
CrossRef citations to date
0
Altmetric
Original Articles

Single machine scheduling problem with batch setups involving positional deterioration effects and multiple rate-modifying activities

, &
Pages 1743-1760 | Received 12 Nov 2017, Accepted 18 Nov 2018, Published online: 20 Dec 2018

References

  • Alidaee, B., and N. K. Womer. 1999. “Scheduling with Time Dependent Processing Times: Review and Extensions.” Journal of the Operational Research Society 50 (7): 711–720. doi: 10.1057/palgrave.jors.2600740
  • Allahverdi, Ali. 2015. “The Third Comprehensive Survey on Scheduling Problems with Setup Times/Costs.” European Journal of Operational Research 246 (2): 345–378. doi: 10.1016/j.ejor.2015.04.004
  • Arigliano, Anna, Gianpaolo Ghiani, Antonio Grieco, and Emanuela Guerriero. 2017. “Single-Machine Time-Dependent Scheduling Problems with Fixed Rate-Modifying Activities and Resumable Jobs.” 4OR 15 (2): 201–215. doi: 10.1007/s10288-016-0333-z
  • Browne, Sid, and Uri Yechiali. 1990. “Scheduling Deteriorating Jobs on a Single Processor.” Operations Research 38 (3): 495–498. doi: 10.1287/opre.38.3.495
  • Brucker, Peter, and Mikhail Y. Kovalyov. 1996. “Single Machine Batch Scheduling to Minimize the Weighted Number of Late Jobs.” Mathematical Methods of Operations Research 43 (1): 1–8. doi: 10.1007/BF01303431
  • Cheng, T. C. E., Q. Ding, and B. M. T. Lin. 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
  • Cheng, T. C. E., Valery S. Gordon, and Mikhail Y. Kovalyov. 1996. “Single Machine Scheduling with Batch Deliveries.” European Journal of Operational Research 94 (2): 277–283. doi: 10.1016/0377-2217(96)00127-0
  • Cheng, T. C. E., Adam Janiak, and Mikhail Y. Kovalyov. 2001. “Single Machine Batch Scheduling with Resource Dependent Setup and Processing Times.” European Journal of Operational Research 135 (1): 177–183. doi: 10.1016/S0377-2217(00)00312-X
  • Cheng, T. C. E., Chin-Chia Wu, and Wen-Chiung Lee. 2008. “Some Scheduling Problems with Deteriorating Jobs and Learning Effects.” Computers & Industrial Engineering 54 (4): 972–982. doi: 10.1016/j.cie.2007.11.006
  • Chung, Byung Do, and Byung Soo Kim. 2016. “A Hybrid Genetic Algorithm with Two-Stage Dispatching Heuristic for a Machine Scheduling Problem with Step-Deteriorating Jobs and Rate-Modifying Activities.” Computers & Industrial Engineering 98: 113–124. doi: 10.1016/j.cie.2016.05.028
  • Chung, Tsui-Ping, and Ching-Jong Liao. 2013. “An Immunoglobulin-Based Artificial Immune System for Solving the Hybrid Flow Shop Problem.” Applied Soft Computing 13 (8): 3729–3736. doi: 10.1016/j.asoc.2013.03.006
  • Gupta, J. N. D. 1971. “M-Stage Scheduling Problem—a Critical Appraisal.” The International Journal of Production Research 9 (2): 267–281. doi: 10.1080/00207547108929878
  • Gupta, Jatinder N. D., and Sushil 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
  • Ji, Min, and T. C. E. Cheng. 2010. “Batch Scheduling of Simple Linear Deteriorating Jobs on a Single Machine to Minimize Makespan.” European Journal of Operational Research 202 (1): 90–98. doi: 10.1016/j.ejor.2009.05.021
  • Ji, Min, Yong He, and T. C. E. Cheng. 2007. “Single-Machine Scheduling with Periodic Maintenance to Minimize Makespan.” Computers & Operations Research 34 (6): 1764–1770. doi:10.1016/j.cor.2005.05.034.
  • Ji, Min, Qinyun Yang, Danli Yao, and T. C. E. Cheng. 2015. “Single-Machine Batch Scheduling of Linear Deteriorating Jobs.” Theoretical Computer Science 580: 36–49. doi:10.1016/j.tcs.2015.02.025.
  • Karmarkar, Uday S., Sham Kekre, Sunder Kekre, and Susan Freeman. 1985. “Lot-Sizing and Lead-Time Performance in a Manufacturing Cell.” Interfaces 15 (2): 1–9. doi: 10.1287/inte.15.2.1
  • Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy-Kan, and D. B. Shmoys. 1993. “Sequencing and Scheduling: Algorithms and Complexity.” Handbooks in Operations Research and Management Science 4: 445–522. doi: 10.1016/S0927-0507(05)80189-6
  • Lee, Wen-Chiung. 2014. “Single-Machine Scheduling with Past-Sequence-Dependent Setup Times and General Effects of Deterioration and Learning.” Optimization Letters 8 (1): 135–144. doi: 10.1007/s11590-012-0481-9
  • Lee, C.-Y., and V. J. Leon. 2001. “Machine Scheduling with a Rate-Modifying Activity.” European Journal of Operational Research 128 (1): 119–128. doi:10.1016/S0377-2217(99)00066-1.
  • Liu, Feng, Jing Yang, and Yuan-Yuan Lu. 2018. “Solution Algorithms for Single-Machine Group Scheduling with Ready Times and Deteriorating Jobs.” Engineering Optimization. doi:10.1080/0305215X.2018.1500562.
  • Melouk, Sharif, Purushothaman Damodaran, and Ping-Yu Chang. 2004. “Minimizing Makespan for Single Machine Batch Processing with Non-Identical Job Sizes Using Simulated Annealing.” International Journal of Production Economics 87 (2): 141–147. doi: 10.1016/S0925-5273(03)00092-6
  • Mor, Baruch, and Gur Mosheiov. 2014. “Batch Scheduling with a Rate-Modifying Maintenance Activity to Minimize Total Flowtime.” International Journal of Production Economics 153: 238–242. doi: 10.1016/j.ijpe.2014.03.004
  • Mosheiov, Gur, and Assaf Sarig. 2009. “Scheduling a Maintenance Activity to Minimize Total Weighted Completion-Time.” Computers & Mathematics with Applications 57 (4): 619–623. doi: 10.1016/j.camwa.2008.11.008
  • Santos, Cipriano, and Michael Magazine. 1985. “Batching in Single Operation Manufacturing Systems.” Operations Research Letters 4 (3): 99–103. doi: 10.1016/0167-6377(85)90011-2
  • Shabtay, Dvir. 2014. “The Single Machine Serial Batch Scheduling Problem with Rejection to Minimize Total Completion Time and Total Rejection Cost.” European Journal of Operational Research 233 (1): 64–74. doi:10.1016/j.ejor.2013.08.013.
  • Strusevich, Vitaly A., and Kabir Rustogi. 2017. Scheduling with Time-Changing Effects and Rate-Modifying Activities. Cham, Switzerland: Springer International Publishing.
  • Wang, Ji-Bo, and Cheng Wang. 2011. “Single-Machine Due-Window Assignment Problem with Learning Effect and Deteriorating Jobs.” Applied Mathematical Modelling 35 (8): 4017–4022. doi: 10.1016/j.apm.2011.02.023
  • Wang, Zhenyou, Cuntao Xiao, Xianwei Lin, and Yuan-Yuan Lu. 2018. “Single Machine Total Absolute Differences Penalties Minimization Scheduling with a Deteriorating and Resource-Dependent Maintenance Activity.” The Computer Journal 61 (1): 105–110. doi: 10.1093/comjnl/bxx044
  • Zhang, Xingong, Win-Chin Lin, Wen-Hsiang Wu, and Chin-Chia Wu. 2017. “Single-Machine Common/Slack Due Window Assignment Problems with Linear Decreasing Processing Times.” Engineering Optimization 49 (8): 1388–1400. doi: 10.1080/0305215X.2016.1248180
  • Zhang, Xingong, Wen-Hsiang Wu, Win-Chin Lin, and Chin-Chia Wu. 2018. “Machine Scheduling Problems under Deteriorating Effects and Deteriorating Rate-Modifying Activities.” Journal of the Operational Research Society 69 (3): 439–448. doi: 10.1057/s41274-017-0200-0
  • Zhang, Xingong, Yunqiang Yin, and Chin-Chia Wu. 2017. “Scheduling with Non-Decreasing Deterioration Jobs and Variable Maintenance Activities on a Single Machine.” Engineering Optimization 49 (1): 84–97. doi:10.1080/0305215X.2016.1163629.
  • Zhu, Zhanguo, Feifeng Zheng, and Chengbin Chu. 2017. “Multitasking Scheduling Problems with a Rate-Modifying Activity.” International Journal of Production Research 55 (1): 296–312. doi: 10.1080/00207543.2016.1208852

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.