Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing (original) (raw)
References
Ahmadizar, F., & Farhadi, S. (2015). Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs. Computers & Operations Research,53, 194–205. Google Scholar
Alam, T., & Raza, Z. (2018). A bacterial foraging-based batch scheduling model for distributed systems. International Journal of Bio-Inspired Computation,11(1), 16–26. Google Scholar
Allahverdi, A., & Al-Anzi, F. S. (2006). Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times. International Journal of Production Research,44(22), 4713–4735. Google Scholar
Azzouz, A., Ennigrou, M., & Ben Said, L. (2018). Scheduling problems under learning effects: Classification and cartography. International Journal of Production Research,56(4), 1642–1661. Google Scholar
Bouffard, V., & Ferland, J. A. (2007). Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem. Journal of Scheduling,10(6), 375–386. Google Scholar
BoussaïD, I., Lepagnot, J., & Siarry, P. (2013). A survey on optimization metaheuristics. Information Sciences,237, 82–117. Google Scholar
Chen, J. C., Chen, Y. Y., Chen, T. L., & Lin, J. Z. (2017). Comparison of simulated annealing and tabu-search algorithms in advanced planning and scheduling systems for TFT-LCD colour filter fabs. International Journal of Computer Integrated Manufacturing,30(6), 516–534. Google Scholar
Cheng, T. E., Hsu, C. J., Huang, Y. C., & Lee, W. C. (2011). Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness. Computers & Operations Research,38(12), 1760–1765. Google Scholar
Cheng, T. E., Lai, P. J., Wu, C. C., & Lee, W. C. (2009). Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations. Information Sciences,179(18), 3127–3135. Google Scholar
Coffman, E. G., Jr., Garey, M. R., & Johnson, D. S. (1978). An application of bin-packing to multiprocessor scheduling. SIAM Journal on Computing,7(1), 1–17. Google Scholar
Costa, L. R., Aloise, D., & Mladenović, N. (2017). Less is more: Basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering. Information Sciences,415, 247–253. Google Scholar
El-Yaakoubi, A., El-Fallahi, A., Cherkaoui, M., & Hamzaoui, M. R. (2017). Tabu search and memetic algorithms for a real scheduling and routing problem. Logistics Research,10(7), 1–18. Google Scholar
Fan, W., Pei, J., Liu, X., Pardalos, P. M., & Kong, M. (2018). Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning. Journal of Global Optimization,71(1), 147–163. Google Scholar
Framinan, J. M., Perez-Gonzalez, P., & Fernandez-Viagas, V. (2019). Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures. European Journal of Operational Research,273(2), 401–417. Google Scholar
Fu, Y., Ding, J., Wang, H., & Wang, J. (2018). Two-objective stochastic flow-shop scheduling with deteriorating and learning effect in Industry 4.0-based manufacturing system. Applied Soft Computing,68, 847–855. Google Scholar
Gawiejnowicz, S. (2008). Time-dependent scheduling. Berlin: Springer. Google Scholar
Hariri, A. M. A., & Potts, C. N. (1997). A branch and bound algorithm for the two-stage assembly scheduling problem. European Journal of Operational Research,103(3), 547–556. Google Scholar
Jia, J., & Mason, S. J. (2009). Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines. International Journal of Production Research,47(10), 2565–2585. Google Scholar
Kress, D., Barketau, M., & Pesch, E. (2018). Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines. Journal of Scheduling,21(6), 595–606. Google Scholar
Liao, C. J., Lee, C. H., & Lee, H. C. (2015). An efficient heuristic for a two-stage assembly scheduling problem with batch setup times to minimize makespan. Computers & Industrial Engineering,88, 317–325. Google Scholar
Liu, P., Yi, N., Zhou, X., & Gong, H. (2013). Scheduling two agents with sum-of-processing-times-based deterioration on a single machine. Applied Mathematics and Computation,219(17), 8848–8855. Google Scholar
Lu, S., Liu, X., Pei, J., Thai, M. T., & Pardalos, P. M. (2018). A hybrid ABC-TS algorithm for the unrelated parallel-batching machines scheduling problem with deteriorating jobs and maintenance activity. Applied Soft Computing,66, 168–182. Google Scholar
Luo, J., Liu, Z., & Xing, K. (2018). Hybrid branch and bound algorithms for the two-stage assembly scheduling problem with separated setup times. International Journal of Production Research,57, 1–15. Google Scholar
Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research,24(11), 1097–1100. Google Scholar
Mladenović, N., Todosijević, R., & Urošević, D. (2016). Less is more: Basic variable neighborhood search for minimum differential dispersion problem. Information Sciences,326, 160–171. Google Scholar
Mor, B., & Mosheiov, G. (2011). Single machine batch scheduling with two competing agents to minimize total flowtime. European Journal of Operational Research,215(3), 524–531. Google Scholar
Pei, J., Liu, X., Pardalos, P. M., Migdalas, A., & Yang, S. (2017). Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine. Journal of Global Optimization,67(1–2), 251–262. Google Scholar
Potts, C. N., Sevast’Janov, S. V., Strusevich, V. A., Van Wassenhove, L. N., & Zwaneveld, C. M. (1995). The two-stage assembly scheduling problem: Complexity and approximation. Operations Research,43(2), 346–355. Google Scholar
Renna, P., & Perrone, G. (2015). Order allocation in a multiple suppliers-manufacturers environment within a dynamic cluster. The International Journal of Advanced Manufacturing Technology,80(1–4), 171–182. Google Scholar
Roh, J., Hong, P., & Min, H. (2014). Implementation of a responsive supply chain strategy in global complexity: The case of manufacturing firms. International Journal of Production Economics,147, 198–210. Google Scholar
Roshanaei, V., Naderi, B., Jolai, F., & Khalili, M. (2009). A variable neighborhood search for job shop scheduling with set-up times to minimize makespan. Future Generation Computer Systems,25(6), 654–661. Google Scholar
Shahvari, O., & Logendran, R. (2018). A comparison of two stage-based hybrid algorithms for a batch scheduling problem in hybrid flow shop with learning effect. International Journal of Production Economics,195, 227–248. Google Scholar
Shokrollahpour, E., Zandieh, M., & Dorri, B. (2011). A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem. International Journal of Production Research,49(11), 3087–3103. Google Scholar
Tao, F., Cheng, Y., Zhang, L., & Nee, A. Y. (2017). Advanced manufacturing systems: Socialization characteristics and trends. Journal of Intelligent Manufacturing,28(5), 1079–1094. Google Scholar
Wang, J. B. (2007). Single-machine scheduling problems with the effects of learning and deterioration. Omega,35(4), 397–402. Google Scholar
Wang, X., & Cheng, T. E. (2007). Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. European Journal of Operational Research,178(1), 57–70. Google Scholar
Wang, J. B., Liu, M., Yin, N., & Ji, P. (2017). Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects. Journal of Industrial & Management Optimization,13(2), 1025–1039. Google Scholar
Wen, Y., Xu, H., & Yang, J. (2011). A heuristic-based hybrid genetic-variable neighborhood search algorithm for task scheduling in heterogeneous multiprocessor system. Information Sciences,181(3), 567–581. Google Scholar
Wu, C. C., Wang, D. J., Cheng, S. R., Chung, I. H., & Lin, W. C. (2018). A two-stage three-machine assembly scheduling problem with a position-based learning effect. International Journal of Production Research,56(9), 3064–3079. Google Scholar
Yang, S., Wang, J., Shi, L., Tan, Y., & Qiao, F. (2018). Engineering management for high-end equipment intelligent manufacturing. Frontiers of Engineering Management,5(4), 420–450. Google Scholar
Yin, Y., Cheng, T. C. E., Hsu, C. J., & Wu, C. C. (2013). Single-machine batch delivery scheduling with an assignable common due window. Omega,41(2), 216–225. Google Scholar
Yin, Y., Cheng, T. C. E., Wang, D., & Wu, C. C. (2015). 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. Google Scholar
Yin, Y., Wang, Y., Cheng, T. C. E., Liu, W., & Li, J. (2017). Parallel-machine scheduling of deteriorating jobs with potential machine disruptions. Omega,69, 17–28. Google Scholar
Yin, Y., Wang, Y., Cheng, T. C. E., Wang, D. J., & Wu, C. C. (2016). Two-agent single-machine scheduling to minimize the batch delivery cost. Computers & Industrial Engineering,92, 16–30. Google Scholar
Yin, Y., Yang, Y., Wang, D., Cheng, T. C. E., & Wu, C. C. (2018). Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents. Naval Research Logistics (NRL),65(5), 393–409. Google Scholar
Zhang, B., Pan, Q. K., Gao, L., & Zhang, X. L. (2018). A hybrid variable neighborhood search algorithm for the hot rolling batch scheduling problem in compact strip production. Computers & Industrial Engineering,116, 22–36. Google Scholar