References
- Adiri, I., and D Pohoryles. 1982. “Flowshop/No-idle or No-wait Scheduling to Minimise the Sum of Completion Times.” Naval Research Logistics Quarterly 29 (3): 495–504.
- Ahmadi-Darani, M. H., G. Moslehi, and M Reisi-Nafchi. 2018. “A Two-agent Scheduling Problem in a Two-machine Flowshop.” International Journal of Industrial Engineering Computations 9 (3): 289–306.
- Billaut, J.-C., F. Della Croce, F. Salassa, and V T'kindt. 2019. “No-idle, No-wait: when Shop Scheduling Meets Dominoes, Eulerian Paths and Hamiltonian Paths.” Journal of Scheduling 22: 59–68.
- Fan, B. Q., and T. C. E Cheng. 2016. “Two-agent Scheduling in a Flowshop.” European Journal of Operational Research 252 (2): 376–384.
- Fink, A., and S Voss. 2003. “Solving the Continuous Flow-shop Scheduling Problem by Metaheuristics.” European Journal of Operational Research 151: 400–414.
- Giaro, K. 2001. “NP-hardness of Compact Scheduling in Simplified Open and Flow Shops.” European Journal of Operational Research 130: 90–98.
- Jeong, B. J., Y.-D. Kim, and S.-O Shim. 2020. “Algorithms for a Two-machine Flowshop Problem with Jobs of Two Classes.” International Transactions in Operations Research 27: 3123–3143.
- Kalczynski, P. J., and J Kamburowski. 2007. “On No-wait and No-idle Flow Shops with Makespan Criterion.” European Journal of Operational Research 178: 677–685.
- Pacciarelli, D., and M Pranzo. 2004. “Production Scheduling in a Steelmaking-Continuous Casting Plant.” Computers and Chemical Engineering 28 (12): 2823–2835.
- Ruiz, R., E. Vallada, and C Fernández-Martínez. 2009. “Scheduling in Flowshops with No-Idle Machines”. In Computational Intelligence in Flow Shop and Job Shop Scheduling. Studies in Computational Intelligence, edited by Chakraborty UK, Vol. 230. Berlin, Heidelberg: Springer.
- Saadani, N. E. H., A. Guinet, and M Moalla. 2003. “Three Stage No-idle Flow-shops.” Computers and Industrial Engineering 44 (3): 425–434.
- Tasgetiren, M. F., Q. K. Pan, P. N. Suganthan, and T. J Chua. 2011. “A Differential Evolution Algorithm for the No-idle Flowshop Scheduling Problem with Total Tardiness Criterion.” International Journal of Production Research 49 (16): 5033–5050.
- Zhao, F., L. Zhang, Y. Zhang, W. Ma, C. Zhang, and H Song. 2020. “A Hybrid Discrete Water Wave Optimization Algorithm for the No-idle Flowshop Scheduling Problem with Total Tardiness Criterion.” Expert Systems With Applications 146: 113–166.
- Zhou, Y., H. Chen, and G Zhou. 2014. “Invasive Weed Optimization Algorithm for Optimization No-idle Flowshop Scheduling Problem.” Neurocomputing 137: 285–292.