References
- Aitzai, A., B. Benmedjdoub, and M. Boudhar. 2016. “Branch-and-Bound and PSO Algorithms for No-Wait Job Shop Scheduling.” Journal of Intelligent Manufacturing 27 (3): 679–688. doi:https://doi.org/10.1007/s10845-014-0906-7.
- Allahverdi, A. 2016. “A Survey of Scheduling Problems with No-Wait in Process.” European Journal of Operational Research 255 (3): 665–686. doi:https://doi.org/10.1016/j.ejor.2016.05.036.
- Applegate, D., and W. J. Cook. 1991. “A Computational Study of the Job-Shop Scheduling Problem.” ORSA Journal on Computing 3 (2): 149–156. doi:https://doi.org/10.1287/ijoc.3.2.149.
- Brizuela, C. A., Y. Zhao, and N. Sannomiya. 2001. “No-Wait and Blocking Job-Shops: Challenging Problems for GA’s.” Paper presented at the IEEE International Conference on Systems.
- Chen, Y. 1994. “Scheduling Jobs to Minimize Total Cost.” European Journal of Operational Research 74 (1): 111–119. doi:https://doi.org/10.1016/0377-2217(94)90208-9.
- Chen, Z., Q. Lu, and G. Tang. 1997. “Single Machine Scheduling with Discretely Controllable Processing Times.” Operations Research Letters 21 (2): 69–76. doi:https://doi.org/10.1016/S0167-6377(97)00010-2.
- Framinan, J., and C. Schuster. 2006. “An Enhanced Timetabling Procedure for the No-Wait Job Shop Problem: A Complete Local Search Approach.” Computers & Operations Research 33 (5): 1200–1213. doi:https://doi.org/10.1016/j.cor.2004.09.009.
- Fu, Y., G. Tian, Z. Li, and Z. Wang. 2018. “Parallel Machine Scheduling with Dynamic Resource Allocation Via a Master-Slave Genetic Algorithm.” Ieej Transactions on Electrical and Electronic Engineering 13 (5): 748–756. doi:https://doi.org/10.1002/tee.22625.
- Gao, F., M. Liu, J. Wang, and Y. Lu. 2018. “No-Wait Two-Machine Permutation Flow Shop Scheduling Problem with Learning Effect, Common Due Date and Controllable Job Processing Times.” International Journal of Production Research 56 (6): 2361–2369. doi:https://doi.org/10.1080/00207543.2017.1371353.
- Grabowski, J., and J. Pempera. 2000. “Sequencing of Jobs in Some Production System.” European Journal of Operational Research 125 (3): 535–550. doi:https://doi.org/10.1016/S0377-2217(99)00224-6.
- Guyon, O., P. Lemaire, E. Pinson, and D. Rivreau. 2012. “Solving an Integrated Jobshop Problem with Human Resource Constraints.” Annals of Operations Research 213 (1): 147–171. doi:https://doi.org/10.1007/s10479-012-1132-3.
- Hall, N. G., and C. Sriskandarajah. 1996. “A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process.” Operations Research 44 (3): 510–525. doi:https://doi.org/10.1287/opre.44.3.510.
- Hsu, C., and D. Yang. 2014. “Unrelated Parallel-Machine Scheduling with Position-Dependent Deteriorating Jobs and Resource-Dependent Processing Time.” Optimization Letters 8 (2): 519–531. doi:https://doi.org/10.1007/s11590-012-0594-1.
- Hunsucker, J. L., and J. R. Shah. 1992. “Performance of Priority Rules in a Due Date Flow Shop.” Omega 20 (1): 73–89. doi:https://doi.org/10.1016/0305-0483(92)90057-E.
- Janiak, A., and M. Y. Kovalyov. 1996. “Single Machine Scheduling Subject to Deadlines and Resource Dependent Processing Times.” European Journal of Operational Research 94 (2): 284–291. doi:https://doi.org/10.1016/0377-2217(96)00129-4.
- Kayvanfar, V., M. Zandieh, and E. Teymourian. 2017. “An Intelligent Water Drop Algorithm to Identical Parallel Machine Scheduling with Controllable Processing Times: A Just-in-Time Approach.” Computational and Applied Mathematics 36 (1): 159–184. doi:https://doi.org/10.1007/s40314-015-0218-3.
- Lawler, E. L., J. K. Lenstra, H. G. Alexander, Rinnooy Kan, and David B. Shmoys. 1993. “Sequencing and Scheduling: Algorithms and Complexity.” Handbooks in Operations Research and Management Science 4: 445–522. doi:https://doi.org/10.1016/S0927-0507(05)80189-6.
- Lawrence, S. 1984. “Supplement to Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques.” Graduate School of Industrial Administration Carnegie Mellon University 4 (7): 4411–4417.
- Leyvand, Y., D. Shabtay, G. Steiner, and L. Yedidsion. 2010. “Just-in-Time Scheduling with Controllable Processing Times on Parallel Machines.” Journal of Combinatorial Optimization 19 (3): 347–368. doi:https://doi.org/10.1007/s10878-009-9270-5.
- Li, J., X. Li, and W. Luo. 2016. “Single-Machine Scheduling with Discretely Controllable Job Processing Times Subject to a Deteriorating Rate-Modifying Activity.” American Journal of Mathematical and Management Sciences 35 (3): 194–206. doi:https://doi.org/10.1080/01966324.2016.1149126.
- Liaw, C. 1998. “An Iterative Improvement Approach for the Nonpreemptive Open Shop Scheduling Problem.” European Journal of Operational Research 111 (3): 509–517. doi:https://doi.org/10.1016/S0377-2217(97)00366-4.
- Lin, S., C. Lu, and K. Ying. 2018. “Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop.” IEEE Access 6: 78666–78677. doi:https://doi.org/10.1109/ACCESS.2018.2885137.
- Lu, Y., J. Jin, P. Ji, and J. Wang. 2016. “Resource-Dependent Scheduling with Deteriorating Jobs and Learning Effects on Unrelated Parallel Machine.” Neural Computing and Applications 27 (7): 1993–2000. doi:https://doi.org/10.1007/s00521-015-1993-x.
- Mccormick, S. T. 1996. Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow. Paper presented at the Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996.
- Niu, G. 2011. “Hybrid Algorithm for JSP with Discretely Controllable Processing Times.” Journal of Mechanical Engineering 47 (04): 186. doi:https://doi.org/10.3901/JME.2011.04.186.
- Ozolins, A. 2018. “A New Exact Algorithm for No-Wait Job Shop Problem to Minimize Makespan.” Operational Research 20 (4): 2333–2363. doi:https://doi.org/10.1007/s12351-018-0414-1.
- Raaymakers, W. H. M., and J. A. Hoogeveen. 2000. “Scheduling Multipurpose Batch Process Industries with No-Wait Restrictions by Simulated Annealing.” European Journal of Operational Research 126 (1): 131–151. doi:https://doi.org/10.1016/S0377-2217(99)00285-4.
- Rajendran, C. 1994. “A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan.” Journal of the Operational Research Society 45 (4): 472–478. doi:https://doi.org/10.1057/jors.1994.65.
- Sahni, S., and Y. Cho. 1979. “Complexity of Scheduling Shops with No Wait in Process.” Mathematics of Operations Research 4 (4): 448–457. doi:https://doi.org/10.1287/moor.4.4.448.
- Samarghandi, H. 2015. “A Particle Swarm Optimisation for the No-Wait Flow Shop Problem with Due Date Constraints.” International Journal of Production Research 53 (9): 2853–2870. doi:https://doi.org/10.1080/00207543.2015.1007245.
- Samarghandi, H. 2019. “Solving the No-Wait Job Shop Scheduling Problem with Due Date Constraints: A Problem Transformation Approach.” Computers & Industrial Engineering 136: 635–662. doi:https://doi.org/10.1016/j.cie.2019.07.054.
- Samarghandi, H., and M. Behroozi. 2017. “On the Exact Solution of the No-Wait Flow Shop Problem with Due Date Constraints.” Computers & Operations Research 81 (MAY): 141–159. doi:https://doi.org/10.1016/j.cor.2016.12.013.
- Samarghandi, H., T. Y. Elmekkawy, and A. M. Ibrahem. 2013. “Studying the Effect of Different Combinations of Timetabling with Sequencing Algorithms to Solve the No-Wait Job Shop Scheduling Problem.” International Journal of Production Research 51 (16): 4942–4965. doi:https://doi.org/10.1080/00207543.2013.784410.
- Schuster, C., and J. M. Framinan. 2003. “Approximative Procedures for No-Wait Job Shop Scheduling.” Operations Research Letters 31 (4): 308–318. doi:https://doi.org/10.1016/S0167-6377(03)00005-1.
- Shabtay, D. 2004. “Single and Two-Resource Allocation Algorithms for Minimizing the Maximal Lateness in a Single Machine.” Computers & Operations Research 31 (8): 1303–1315. doi:https://doi.org/10.1016/S0305-0548(03)00081-9.
- Shabtay, D., and M. Kaspi. 2004. “Minimizing the Total Weighted Flow Time in a Single Machine with Controllable Processing Times.” Computers & Operations Research 31 (13): 2279–2289. doi:https://doi.org/10.1016/S0305-0548(03)00187-4.
- Shabtay, D., M. Kaspi, and G. Steiner. 2007. “The No-Wait Two-Machine Flow Shop Scheduling Problem with Convex Resource-Dependent Processing Times.” Iie Transactions 39 (5): 539–557. doi:https://doi.org/10.1080/07408170601181674.
- Shabtay, D., and G. Steiner. 2007. “A Survey of Scheduling with Controllable Processing Times.” Discrete Applied Mathematics 155 (13): 1643–1666. doi:https://doi.org/10.1016/j.dam.2007.02.003.
- Shakhlevich, N. V., A. Shioura, and V. A. Strusevich. 2009. “Single Machine Scheduling with Controllable Processing Times by Submodular Optimization.” International Journal of Foundations of Computer Science 20 (02): 247–269. doi:https://doi.org/10.1142/S0129054109006541.
- Shin, J., J. Yu, H. Doh, H. Kim, and D. Lee. 2020. “Batching and Scheduling for a Single-Machine Flexible Machining Cell with Multi-Fixturing Pallets and Controllable Processing Times.” International Journal of Production Research 58 (3): 863–877. doi:https://doi.org/10.1080/00207543.2019.1602742.
- Shioura, A., N. V. Shakhlevich, and V. A. Strusevich. 2018. “Preemptive Models of Scheduling with Controllable Processing Times and of Scheduling with Imprecise Computation: A Review of Solution Approaches.” European Journal of Operational Research 266 (3): 795–818. doi:https://doi.org/10.1016/j.ejor.2017.08.034.
- Sundar, S., P. N. Suganthan, C. T. Jin, C. T. Xiang, and C. C. Soon. 2015. “A Hybrid Artificial Bee Colony Algorithm for the Job-Shop Scheduling Problem with No-Wait Constraint.” Paper presented at the Soft Computing.
- Wang, D., Y. Yin, and T. C. E. Cheng. 2018. “Parallel-Machine Rescheduling with Job Unavailability and Rejection.” Omega-international Journal of Management Science 81: 246–260. doi:https://doi.org/10.1016/j.omega.2018.04.008.
- Wang, D. J., Y. Q. Yin, and M. Q. Liu. 2016. “Bicriteria Scheduling Problems Involving Job Rejection, Controllable Processing Times and Rate-Modifying Activity.” International Journal of Production Research 54 (12): 3691–3705. doi:https://doi.org/10.1080/00207543.2015.1136081.
- Yin, Y., T. C. E. Cheng, D. Wang, and C. Wu. 2016. “Improved Algorithms for Single-Machine Serial-Batch Scheduling with Rejection to Minimize Total Completion Time and Total Rejection Cost.” IEEE Transactions on Systems, Man, and Cybernetics: Systems 46 (11): 1578–1588. doi:https://doi.org/10.1109/TSMC.2015.2505644.
- Yin, Y., T. C. E. Cheng, C. Wu, and S. Cheng. 2014. “Single-Machine Due Window Assignment and Scheduling with a Common Flow Allowance and Controllable Job Processing Time.” Journal of the Operational Research Society 65 (1): 1–13. doi:https://doi.org/10.1057/jors.2012.161.
- Zhou, B., and T. Peng. 2019. “New Single Machine Scheduling with Nonnegative Inventory Constraints and Discretely Controllable Processing Times.” Optimization Letters 13 (5): 1111–1142. doi:https://doi.org/10.1007/s11590-019-01407-y.
- Zhou, Y. D., J. H. Shin, and D. Lee. 2019. “Loading and Scheduling for Flexible Manufacturing Systems with Controllable Processing Times.” Engineering Optimization 51 (3): 412–426. doi:https://doi.org/10.1080/0305215X.2018.1469134.
- Zhu, J., X. Li, and Q. Wang. 2009. “Complete Local Search with Limited Memory Algorithm for No-Wait Job Shops to Minimize Makespan.” European Journal of Operational Research 198 (2): 378–386. doi:https://doi.org/10.1016/j.ejor.2008.09.015.