73
Views
43
CrossRef citations to date
0
Altmetric
General Paper

Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions

, &
Pages 147-156 | Received 01 Sep 2010, Accepted 01 Sep 2011, Published online: 21 Dec 2017

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (2)

Vahid Azizi & Guiping Hu. (2020) A branch and bound algorithm to solve a two-machine no-wait flowshop scheduling problem with truncated learning function. International Journal of Management Science and Engineering Management 15:2, pages 89-95.
Read now
Ameni Azzouz, Meriem Ennigrou & Lamjed Ben Said. (2018) Scheduling problems under learning effects: classification and cartography. International Journal of Production Research 56:4, pages 1642-1661.
Read now

Articles from other publishers (41)

Ming-Hui Li, Dan-Yang Lv, Yuan-Yuan Lu & Ji-Bo Wang. (2024) Scheduling with Group Technology, Resource Allocation, and Learning Effect Simultaneously. Mathematics 12:7, pages 1029.
Crossref
Yifu Feng, Zonghai Hu, Rui Si & Ji-Bo Wang. (2023) Study on Due-Date Assignment Scheduling with Setup Times and General Truncated Learning Effects. Asia-Pacific Journal of Operational Research 41:01.
Crossref
Tessa Borgonjon & Broos Maenhout. (2024) The impact of dynamic learning and training on the personnel staffing decision. Computers & Industrial Engineering 187, pages 109784.
Crossref
Jian-You Xu, Win-Chin Lin, Yu-Wei Chang, Yu-Hsiang Chung, Juin-Han Chen & Chin-Chia Wu. (2023) A Two-Machine Learning Date Flow-Shop Scheduling Problem with Heuristics and Population-Based GA to Minimize the Makespan. Mathematics 11:19, pages 4060.
Crossref
Na Ren, Ji-Bo Wang & Ershen Wang. (2023) Research on delivery times scheduling with truncated learning effects. Computational and Applied Mathematics 42:6.
Crossref
Ji-Bo Wang, Li-Han Zhang, Zheng-Guo Lv, Dan-Yang Lv, Xin-Na Geng & Xinyu Sun. (2022) Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects. Computational and Applied Mathematics 41:8.
Crossref
Ran Ma, Sainan Guo & Xiaoyan Zhang. (2022) An optimal online algorithm for single-processor scheduling problem with learning effect. Theoretical Computer Science 928, pages 1-12.
Crossref
Xue Jia, Jing Xue, Shi-Yun Wang & Ji-Bo Wang. (2022) Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times. Mathematical Biosciences and Engineering 19:9, pages 8923-8934.
Crossref
Zhongyi Jiang, Fangfang Chen & Xiandong Zhang. (2021) Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect. Journal of Combinatorial Optimization 43:1, pages 116-139.
Crossref
Ran Ma, Wenwen Han, Cuixia Miao & Juan Zou. (2021) An Optimal Online Algorithm for Scheduling with Learning Consideration. Asia-Pacific Journal of Operational Research 38:05.
Crossref
Bayi Cheng, Jie Duan, Xiaoxi Zhu & Mi Zhou. (2021) Optimizing batch operations with batch-position-dependent learning effect and aging effect. Computers & Industrial Engineering 157, pages 107325.
Crossref
Ji‐Bo Wang, Dan‐Yang Lv, Jian Xu, Ping Ji & Fuqiang Li. (2020) Bicriterion scheduling with truncated learning effects and convex controllable processing times. International Transactions in Operational Research 28:3, pages 1573-1593.
Crossref
Jun-Ho Lee, Tae-Sun Yu & Kyungsu Park. (2021) Scheduling of Flow Shop with Overlapping Waiting Time Constraints Using Genetic Algorithm. Journal of the Korean Institute of Industrial Engineers 47:1, pages 34-44.
Crossref
Ameni Azzouz, Po-An Pan, Peng-Hsiang Hsu, Win-Chin Lin, Shangchia Liu, Lamjed Ben Said & Chin-Chia Wu. (2019) A two-stage three-machine assembly scheduling problem with a truncation position-based learning effect. Soft Computing 24:14, pages 10515-10533.
Crossref
Yunqing Zou, Dujuan Wang, Win-Chin Lin, Jia-Yang Chen, Pay-Wen Yu, Wen-Hsiang Wu, Yuan-Po Chao & Chin-Chia Wu. (2019) Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect. Soft Computing 24:7, pages 5445-5462.
Crossref
Baoyu Liao, Xingming Wang, Xing Zhu, Shanlin Yang & Panos M. Pardalos. (2019) Less is more approach for competing groups scheduling with different learning effects. Journal of Combinatorial Optimization 39:1, pages 33-54.
Crossref
Xi-Xi Liang, Bo Zhang, Ji-Bo Wang, Na Yin & Xue Huang. (2019) Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects. Journal of Applied Mathematics and Computing 61:1-2, pages 373-388.
Crossref
Dujuan Wang, Huaxin Qiu, Chin-Chia Wu, Win-Chin Lin, Kunjung Lai & Shuenn-Ren Cheng. (2018) Dominance rule and opposition-based particle swarm optimization for two-stage assembly scheduling with time cumulated learning effect. Soft Computing 23:19, pages 9617-9628.
Crossref
Bayi Cheng, Huijun Zhu, Kai Li & Yongjun Li. (2019) Optimization of batch operations with a truncated batch-position-based learning effect. Omega 85, pages 134-143.
Crossref
Hyun-Jung Kim & Jun-Ho Lee. (2019) Three-machine flow shop scheduling with overlapping waiting time constraints. Computers & Operations Research 101, pages 93-102.
Crossref
Danyu Bai, Mengqian Tang, Zhi-Hai Zhang & Ernesto DR Santibanez-Gonzalez. (2018) Flow shop learning effect scheduling problem with release dates. Omega 78, pages 21-38.
Crossref
Wenjuan Fan, Jun Pei, Xinbao Liu, Panos M. Pardalos & Min Kong. (2017) Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning. Journal of Global Optimization 71:1, pages 147-163.
Crossref
Changchun Liu, Chenjie Wang, Zhi-hai Zhang & Li Zheng. (2018) Scheduling with job-splitting considering learning and the vital-few law. Computers & Operations Research 90, pages 264-274.
Crossref
Na Yin. (2017) Single machine due window assignment resource allocation scheduling with job-dependent learning effect. Journal of Applied Mathematics and Computing 56:1-2, pages 715-725.
Crossref
Chin-Chia Wu, Shang-Chia Liu, Chuanli Zhao, Sheng-Zhi Wang & Win-Chin Lin. (2018) A Multi-Machine Order Scheduling with Learning Using the Genetic Algorithm and Particle Swarm Optimization. The Computer Journal 61:1, pages 14-31.
Crossref
Xingong Zhang, Win-Chin Lin, Chou-Jung Hsu & Chin-Chia Wu. (2017) Resource constrained scheduling problems with general truncated sum-of-processing time dependent effect under single machine and unrelated parallel machines. Computers & Industrial Engineering 110, pages 344-352.
Crossref
Hongyu He, Mengqi Liu & Ji-Bo Wang. (2015) Resource constrained scheduling with general truncated job-dependent learning effect. Journal of Combinatorial Optimization 33:2, pages 626-644.
Crossref
Ji-Bo Wang, Mengqi Liu, Na Yin & Ping Ji. (2017) Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects. Journal of Industrial & Management Optimization 13:2, pages 1025-1039.
Crossref
Jianyou Xu, Chin-Chia Wu, Yunqiang Yin, Chuanli Zhao, Yi-Tang Chiou & Win-Chin Lin. (2016) An order scheduling problem with position-based learning effect. Computers & Operations Research 74, pages 175-186.
Crossref
Chenjie Wang, Changchun Liu, Zhi-hai Zhang & Li Zheng. (2016) Minimizing the total completion time for parallel machine scheduling with job splitting and learning. Computers & Industrial Engineering 97, pages 170-182.
Crossref
Yu-Bin Wu & Jian-Jun Wang. (2015) Single-machine scheduling with truncated sum-of-processing-times-based learning effect including proportional delivery times. Neural Computing and Applications 27:4, pages 937-943.
Crossref
Jibo Wang & Chou-Jung Hsu. (2016) Unrelated Parallel-Machine Scheduling Problems with General Truncated Job-Dependent Learning Effect. Journal of Applied Mathematics and Physics 04:01, pages 21-27.
Crossref
Xin-Jun Li, Jian-Jun Wang & Xue-Ru Wang. (2015) Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times. Asia-Pacific Journal of Operational Research 32:05, pages 1550033.
Crossref
Yuan-Yuan Lu, Fei Teng & Zhi-Xin Feng. (2015) Scheduling Jobs with Truncated Exponential Sum-of-Logarithm-Processing-Times Based and Position-based Learning Effects. Asia-Pacific Journal of Operational Research 32:04, pages 1550026.
Crossref
Wen-Hsiang Wu, Wen-Hung Wu, Juei-Chao Chen, Win-Chin Lin, Jungpin Wu & Chin-Chia Wu. (2015) A heuristic-based genetic algorithm for the two-machine flowshop scheduling with learning consideration. Journal of Manufacturing Systems 35, pages 223-233.
Crossref
Yu-Ping Niu, Jia Wang & Na Yin. (2014) Scheduling problems with effects of deterioration and truncated job-dependent learning. Journal of Applied Mathematics and Computing 47:1-2, pages 315-325.
Crossref
Shang-Chia Liu, Wei-Ling Hung & Chin-Chia Wu. (2015) Note on a Single-Machine Scheduling Problem with Sum of Processing Times Based Learning and Ready Times. Mathematical Problems in Engineering 2015, pages 1-9.
Crossref
Hongjie Li, Zeyuan Li & Yunqiang Yin. (2014) Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents. The Scientific World Journal 2014, pages 1-7.
Crossref
Xiao-Yuan Wang, Zhili Zhou, Xi Zhang, Ping Ji & Ji-Bo Wang. (2013) Several flow shop scheduling problems with truncated position-based learning effect. Computers & Operations Research 40:12, pages 2906-2929.
Crossref
Xue Huang, Gang Li, Yunzhang Huo & Ping Ji. (2012) Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times. Optimization Letters 7:8, pages 1793-1804.
Crossref
Mingbao Cheng. (2013) Flowshop Scheduling Problems with a Position-Dependent Exponential Learning Effect. Mathematical Problems in Engineering 2013, pages 1-5.
Crossref

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.