Niloy J. Mukherjee, Subhash C. Sarin & Daniel A. Neira. (2023) Lot streaming for a two-stage assembly system in the presence of handling costs. Journal of Scheduling 26:4, pages 335-351.
Crossref
C. Ramesh, R. Kamalakannan, R. Karthik, C. Pavin & S. Dhivaharan. (2021) A lot streaming based flow shop scheduling problem using simulated annealing algorithm. Materials Today: Proceedings 37, pages 241-244.
Crossref
Pourya Pourhejazy, Shih-Wei Lin, Chen-Yang Cheng, Kuo-Ching Ying & Pei-Yu Lin. (2020) Improved Beam Search for Optimizing No-Wait Flowshops With Release Times. IEEE Access 8, pages 148100-148124.
Crossref
Juan M. Novas. (2019) Production scheduling and lot streaming at flexible job-shops environments using constraint programming. Computers & Industrial Engineering 136, pages 252-264.
Crossref
Tsan-Ming Choi, Wing-Kwan Yeung, T. C. Edwin Cheng & Xiaohang Yue. (2018) Optimal Scheduling, Coordination, and the Value of RFID Technology in Garment Manufacturing Supply Chains. IEEE Transactions on Engineering Management 65:1, pages 72-84.
Crossref
Bryndis Stefansdottir, Martin Grunow & Renzo Akkerman. (2017) Classifying and modeling setups and cleanings in lot sizing and scheduling. European Journal of Operational Research 261:3, pages 849-865.
Crossref
Zhiyang Jia, Liang Zhang, Jorge Arinez & Guoxian Xiao. (2016) Finite Production Run-Based Serial Lines With Bernoulli Machines: Performance Analysis, Bottleneck, and Case Study. IEEE Transactions on Automation Science and Engineering 13:1, pages 134-148.
Crossref
Fantahun M. Defersha. (2015) A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem. International Transactions in Operational Research 22:4, pages 669-691.
Crossref
Zhiyang Jia, Liang Zhang, Jorge Arinez & Guoxian Xiao. (2014) Analysis and improvement of batch-based production lines with Bernoulli machines. Analysis and improvement of batch-based production lines with Bernoulli machines.
Kesheng Lu & Lingzhi Wang. (2013) A discrete differential evolution algorithm for lot-streaming flow shop scheduling problems. A discrete differential evolution algorithm for lot-streaming flow shop scheduling problems.
Hong-yan Sang & Jun-hua Duan. (2012) An efficient discrete artificial bee colony algorithm for total flowtime lot-streaming flowshop. An efficient discrete artificial bee colony algorithm for total flowtime lot-streaming flowshop.
Quan-Ke Pan & Rubén Ruiz. (2012) An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega 40:2, pages 166-180.
Crossref
Quan-Ke Pan, M. Fatih Tasgetiren, P.N. Suganthan & T.J. Chua. (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information Sciences 181:12, pages 2455-2468.
Crossref
Quan-Ke Pan, P.N. Suganthan, J.J. Liang & M. Fatih Tasgetiren. (2011) A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem. Expert Systems with Applications 38:4, pages 3252-3259.
Crossref
Jun-Hua Duan, Quan-ke Pan, KaiZhuo Gao, Junqing Li & Zhenqiang Bao. (2010) Scheduling the lot-streaming flow shop problem using a shuffled frog-leaping algorithm. Scheduling the lot-streaming flow shop problem using a shuffled frog-leaping algorithm.
Hong-yan Sang. (2010) A discrete differential evolution algorithm for lot-streaming flow shop scheduling problems. A discrete differential evolution algorithm for lot-streaming flow shop scheduling problems.
Quan-Ke Pan, Mehmet Fatih Tasgetiren, Ponnuthurai Nagaratnam Suganthan & Yun-Chia Liang. (2010) Solving lot-streaming flow shop scheduling problems using a discrete harmony search algorithm. Solving lot-streaming flow shop scheduling problems using a discrete harmony search algorithm.
Quan-Ke Pan, Jun-hua Duan, J. J. Liang, Kaizhou Gao & Junqing Li. (2010) A novel discrete harmony search algorithm for scheduling lot-streaming flow shops. A novel discrete harmony search algorithm for scheduling lot-streaming flow shops.
Tao-feng Ye & Qing-li Da. (2009) A development on lot streaming with supplier-manufacturer coordination. A development on lot streaming with supplier-manufacturer coordination.
Taofeng Ye. (2009) Queueing network analysis on dynamic lot streaming. Computers & Operations Research 36:2, pages 415-424.
Crossref
S. Marimuthu, S.G. Ponnambalam & N. Jawahar. (2009) Threshold accepting and Ant-colony optimization algorithms for scheduling m-machine flow shops with lot streaming. Journal of Materials Processing Technology 209:2, pages 1026-1041.
Crossref
Rong-Hwa Huang & Chang-Lin Yang. (2008) Overlapping production scheduling planning with multiple objectives—An ant colony approach. International Journal of Production Economics 115:1, pages 163-170.
Crossref
S. Marimuthu, S.G. Ponnambalam & N. Jawahar. (2008) Evolutionary algorithms for scheduling m-machine flow shop with lot streaming. Robotics and Computer-Integrated Manufacturing 24:1, pages 125-139.
Crossref
KwanWoo Kim & In-Jae Jeong. (2007) Flow Shop Scheduling with No-wait Flexible Lot Streaming using Adaptive Genetic Algorithm. Flow Shop Scheduling with No-wait Flexible Lot Streaming using Adaptive Genetic Algorithm.
S Marimuthu, S G Ponnambalam & N Jawahar. (2007) Tabu Search and Simulated Annealing Algorithms for Scheduling in Flow Shops with Lot Streaming. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 221:2, pages 317-331.
Crossref
Tapan P. Bagchi, Jatinder N.D. Gupta & Chelliah Sriskandarajah. (2006) A review of TSP based approaches for flowshop scheduling. European Journal of Operational Research 169:3, pages 816-854.
Crossref
Wei Zhang, Changyu Yin, Jiyin Liu & Richard J. Linn. (2005) Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops. International Journal of Production Economics 96:2, pages 189-200.
Crossref
Chung‐Lun Li & Wen‐Qiang Xiao. (2004) Lot streaming with supplier–manufacturer coordination. Naval Research Logistics (NRL) 51:4, pages 522-542.
Crossref
V. Ganapathy, S. Marimuthu & S.G. Ponnambalam. (2004) Tabu search and simulated annealing algorithms for lot-streaming in two-machine flowshop. Tabu search and simulated annealing algorithms for lot-streaming in two-machine flowshop.
S. Marimuthu, S.G. Ponnambalam & R.K. Suresh. (2004) Evolutionary algorithm and threshold accepting algorithm for scheduling in two-machine flow shop with lot streaming. Evolutionary algorithm and threshold accepting algorithm for scheduling in two-machine flow shop with lot streaming.
Subodha Kumar, Tapan P Bagchi & C Sriskandarajah. (2000) Lot streaming and scheduling heuristics for m-machine no-wait flowshops. Computers & Industrial Engineering 38:1, pages 149-172.
Crossref