195
Views
14
CrossRef citations to date
0
Altmetric
Original Articles

Minimising the total completion time in a single machine scheduling problem under bimodal flexible periodic availability constraints

&
Pages 323-341 | Received 03 Sep 2013, Accepted 26 Nov 2014, Published online: 27 Mar 2015

References

  • Adiri, I., J. Bruno, E. Frostig, and A. H. G. RinnooyKan. 1989. “Single Machine Flow Time Scheduling with a Single Breakdown.” Acta Informatica 26 (7): 679–696. doi:10.1007/BF00288977.
  • Batun, S., and M. Azizoğlu. 2009. “Single Machine Scheduling with Preventive Maintenances.” International Journal of Production Research 47 (7): 1753–1771. doi:10.1080/00207540701636348.
  • Chen, J.-S.. 2006a. “Using Integer Programming to Solve the Machine Scheduling Problem with a Flexible Maintenance Activity.” Journal of Statistics and Management Systems 9 (1): 87–104. doi:10.1080/09720510.2006.10701195.
  • Chen, J.-S.. 2006b. “Optimization Models for the Machine Scheduling Problem with a Single Flexible Maintenance Activity.” Engineering Optimization 38 (1): 53–71. doi:10.1080/03052150500270594.
  • Chen, J.-S. 2008. “Scheduling of Non-Resumable Jobs and Flexible Maintenance Activities on a Single Machine to Minimize Makespan.” European Journal of Operational Research 190 (1): 90–102. doi:10.1016/j.ejor.2007.06.029.
  • Chen, W. J. 2009a. “Minimizing Number of Tardy Jobs on a Single Machine Subject to Periodic Maintenance.” Omega 37 (3): 591–599. doi:10.1016/j.omega.2008.01.001.
  • Chen, W. J. 2009b. “Scheduling with Dependent Setups and Maintenance in a Textile Company.” Computers and Industrial Engineering 57 (3): 867–873. doi:10.1016/j.cie.2009.03.001.
  • Chen, W.-J. 2007. “An Efficient Algorithm for Scheduling Jobs on a Machine with Periodic Maintenance.” The International Journal of Advanced Manufacturing Technology 34 (11–12): 1173–1182. doi:10.1007/s00170-006-0689-x.
  • Cheng, T. C. E., S.-J. Yang, and D.-L. Yang. 2012. “Common Due-Window Assignment and Scheduling of Linear Time-Dependent Deteriorating Jobs and a Deteriorating Maintenance Activity.” International Journal of Production Economics 135 (1): 154–161. doi:10.1016/j.ijpe.2010.10.005.
  • Ganji, F. 2011. “Single Machine Scheduling with a Flexible Maintenance Activity.” MS Thesis, Isfahan University of Technology.
  • Graves, G. H., and C. Y. Lee. 1999. “Scheduling Maintenance and Semi-Resumable Jobs on a Single Machine.” Naval Research Logistics 46 (7): 845–863. doi:10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#.
  • Jin, Y.-L., Z.-H. Jiang, and W.-R. Hou. 2009. “Integrating Flexible-Interval Preventive Maintenance Planning with Production Scheduling.” International Journal of Computer Integrated Manufacturing 22 (12): 1089–1101. doi:10.1080/09511920903207449.
  • Kacem, I., and C. Chu. 2008. “Minimizing the Weighted Flow Time on a Single Machine with the Resumable Availability Constraint: Worst Case of the WSPT Heuristic.” International Journal of Computer Integrated Manufacturing 21 (4): 388–395. doi:10.1080/09511920701575088.
  • Lee, J.-Y., and Y.-D. Kim. 2012. “Minimizing the Number of Tardy Jobs in a Single-Machine Scheduling Problem with Periodic Maintenance.” Computers and Operations Research 39 (9): 2196–2205. doi:10.1016/j.cor.2011.11.002.
  • Low, C., C.-J. Hsu, and C.-T. Su. 2010. “A Modified Particle Swarm Optimization Algorithm for a Single-Machine Scheduling Problem with Periodic Maintenance.” Expert Systems with Applications 37 (9): 6429–6434. doi:10.1016/j.eswa.2010.02.075.
  • Low, C., M. Ji, C.-J. Hsu, and C.-T. Su. 2010. “Minimizing the Makespan in a Single Machine Scheduling Problems with Flexible and Periodic Maintenance.” Applied Mathematical Modelling 34 (2): 334–342. doi:10.1016/j.apm.2009.04.014.
  • Ma, Y., C. Chu, and C. Zuo. 2010. “A Survey of Scheduling with Deterministic Machine Availability Constraints.” Computers and Industrial Engineering 58 (2): 199–211. doi:10.1016/j.cie.2009.04.014.
  • Mehta, S. V. 1999. “Predictable Scheduling of a Single Machine Subject to Breakdowns.” International Journal of Computer Integrated Manufacturing 12 (1): 15–38. doi:10.1080/095119299130443.
  • Molaee, E., G. Moslehi, and M. Reisi. 2011. “Minimizing Maximum Earliness and Number of Tardy Jobs in the Single Machine Scheduling Problem with Availability Constraint.” Computers and Mathematics with Applications 62 (9): 3622–3641. doi:10.1016/j.camwa.2011.09.016.
  • Mosheiov, G., and A. Sarig. 2009. “Scheduling a Maintenance Activity to Minimize Total Weighted Completion Time.” Computers and Mathematics with Applications 57 (4): 619–623. doi:10.1016/j.camwa.2008.11.008.
  • Phanden, R. K., A. Jain, and R. Verma. 2011. “Integration of Process Planning and Scheduling: A State-of-the-Art Review.” International Journal of Computer Integrated Manufacturing 24 (6): 517–534. doi:10.1080/0951192X.2011.562543.
  • Phanden, R. K., A. Jain, and R. Verma. 2013. “An Approach for Integration of Process Planning and Scheduling.” International Journal of Computer Integrated Manufacturing 26 (4): 284–302. doi:10.1080/0951192X.2012.684721.
  • Qi, X., T. Chen, and F. Tu. 1999. “Scheduling the Maintenance on a Single Machine.” Journal of the Operational Research Society 50 (10): 1071–1078. doi:10.1057/palgrave.jors.2600791.
  • Sbihi, M., and C. Varnier. 2008. “Single Machine Scheduling with Periodic and Flexible Periodic Maintenance to Minimize Maximum Tardiness.” Computers and Industrial Engineering 55 (4): 830–840. doi:10.1016/j.cie.2008.03.005.
  • Wu, Y., M. Dong, and Z. H. Zheng. 2014. “Patient Scheduling with Periodic Deteriorating Maintenance on Single Medical Device.” Computers & Operations Research 49 (10): 107–116. doi:10.1016/j.cor.2014.04.005.
  • Xu, D., Y. Yin, and H. Li. 2010. “Scheduling Jobs under Increasing Linear Machine Maintenance Time.” Journal of Scheduling 13 (4): 443–449. doi:10.1007/s10951-010-0182-0.
  • Yang, D.-L., C.-L. Hung, J. Hsu, and M.-S. Chern. 2002. “Minimizing the Makespan in a Single Machine Scheduling Problem with a Flexible Maintenance Activity.” Journal of the Chinese Institute of Industrial Engineers 19 (1): 63–66. doi:10.1080/10170660209509183.
  • Yang, S.-J. 2010. “Single Machine Scheduling Problems with Both Start-Time Dependent Learning and Position Dependent Aging Effects under Deteriorating Maintenance Consideration.” Applied Mathematics and Computation 217 (7): 3321–3329. doi:10.1016/j.amc.2010.08.064.
  • Yang, S.-J., and D.-L. Yang. 2010a. “Minimizing the Makespan on Single Machine Scheduling with Aging Effect and Variable Maintenance Activities.” Omega 38 (6): 528–533. doi:10.1016/j.omega.2010.01.003.
  • Yang, S.-J., and D.-L. Yang. 2010b. “Minimizing the Total Completion Time in Single Machine Scheduling with Aging/Deteriorating Effects and Deteriorating Maintenance Activities.” Computers and Mathematics with Applications 60 (7): 2161–2169. doi:10.1016/j.camwa.2010.08.003.
  • Yang, S.-J., D.-L. Yang, and T. C. E. Cheng. 2010. “Single Machine Due-Window Assignment and Scheduling with Job Dependent Aging Effects and Deteriorating Maintenance.” Computers and Operations Research 37 (8): 1510–1514. doi:10.1016/j.cor.2009.11.007.
  • Yang, S.-L., Y. Ma, D.-L. Xu, and J.-B. Yang. 2011. “Minimizing Total Completion Time on a Single Machine with a Flexible Maintenance Activity.” Computers & Operations Research 38 (4): 755–770. doi:10.1016/j.cor.2010.09.003.
  • Zhao, C.-L., and H.-Y. Tang. 2010. “Single Machine Scheduling with General Job Dependent Aging Effect and Maintenance Activities to Minimize Makespan.” Applied Mathematical Modelling 34 (3): 837–841. doi:10.1016/j.apm.2009.07.002.

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.