• Lee W, Oh S, Park J, Lee C, Fan H, Arinez J, An S and Do Noh S. Matrix Assembly System Scheduling Optimization in Automotive Manufacturing: A Deep Q-Network Approach. Proceedings of the Winter Simulation Conference. (3434-3445).

    /doi/10.5555/3712729.3713016

  • Yang D, Qian B, Zhang Z, Hu R and Li K. A Hyper-Heuristic Algorithm with Q-Learning for Distributed Flow Shop-Vehicle Transport-U-Assembly Integrated Scheduling Problem. Advanced Intelligent Computing Technology and Applications. (300-310).

    https://doi.org/10.1007/978-981-97-5578-3_24

  • Wang Z and Liao W. (2024). Smart scheduling of dynamic job shop based on discrete event simulation and deep reinforcement learning. Journal of Intelligent Manufacturing. 35:6. (2593-2610). Online publication date: 1-Aug-2024.

    https://doi.org/10.1007/s10845-023-02161-w

  • Jiang X, Lee K and Pinedo M. (2024). Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits. Journal of Scheduling. 27:1. (61-86). Online publication date: 1-Feb-2024.

    https://doi.org/10.1007/s10951-023-00781-x

  • Lan K, Zhang Z, Qian B, Hu R and Zhang D. A Hyper-Heuristic Algorithm with Q-Learning for Distributed Permutation FlowshopScheduling Problem. Advanced Intelligent Computing Technology and Applications. (122-131).

    https://doi.org/10.1007/978-981-99-4755-3_11

  • Song H, Yang Y, Lin J and Ye J. (2023). An effective hyper heuristic-based memetic algorithm for the distributed assembly permutation flow-shop scheduling problem. Applied Soft Computing. 135:C. Online publication date: 1-Mar-2023.

    https://doi.org/10.1016/j.asoc.2023.110022

  • Strusevich V. (2022). Complexity and approximation of open shop scheduling to minimize the makespan. Computers and Operations Research. 144:C. Online publication date: 1-Aug-2022.

    https://doi.org/10.1016/j.cor.2022.105732

  • Chen Y, Cai Y, Liu L, Chen G, Goebel R, Lin G, Su B and Zhang A. (2022). Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. Journal of Combinatorial Optimization. 43:3. (571-588). Online publication date: 1-Apr-2022.

    https://doi.org/10.1007/s10878-021-00793-3

  • Dong J, Goebel R, Hu J, Lin G and Su B. (2021). Minimizing total job completion time in MapReduce scheduling. Computers and Industrial Engineering. 158:C. Online publication date: 1-Aug-2021.

    https://doi.org/10.1016/j.cie.2021.107387

  • Leng C, Qiao Y, Hu X and Wang H. (2020). Co-scheduling aperiodic real-time tasks with end-to-end firm and soft deadlines in two-stage systems. Real-Time Systems. 56:4. (391-451). Online publication date: 1-Oct-2020.

    https://doi.org/10.1007/s11241-020-09352-1

  • Liu L, He H and Shi L. A new solution approach for flow shop scheduling with an exponential time-dependent learning effect. 2019 IEEE 15th International Conference on Automation Science and Engineering (CASE). (468-473).

    https://doi.org/10.1109/COASE.2019.8843150

  • Kagaris D and Dutta S. (2019). Scheduling Mutual Exclusion Accesses in Equal-Length Jobs. ACM Transactions on Parallel Computing. 6:2. (1-26). Online publication date: 30-Jun-2019.

    https://doi.org/10.1145/3342562

  • Dong J, Jin R, Hu J and Lin G. (2019). A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops. Journal of Combinatorial Optimization. 37:2. (668-684). Online publication date: 1-Feb-2019.

    https://doi.org/10.1007/s10878-018-0314-6

  • Tong W, Miyano E, Goebel R and Lin G. (2018). An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops. Theoretical Computer Science. 734:C. (24-31). Online publication date: 22-Jul-2018.

    https://doi.org/10.1016/j.tcs.2017.09.018

  • Cai Y, Chen G, Chen Y, Goebel R, Lin G, Liu L and Zhang A. Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph. Computing and Combinatorics. (205-217).

    https://doi.org/10.1007/978-3-319-94776-1_18

  • Marichelvam M, Tosun m and Geetha M. (2017). Hybrid monkey search algorithm for flow shop scheduling problem under makespan and total flow time. Applied Soft Computing. 55:C. (82-92). Online publication date: 1-Jun-2017.

    https://doi.org/10.1016/j.asoc.2017.02.003

  • Sheibani K. (2017). An Incorporation of the Fuzzy Greedy Search Heuristic With Evolutionary Approaches for Combinatorial Optimization in Operations Management. International Journal of Applied Evolutionary Computation. 8:2. (58-72). Online publication date: 1-Apr-2017.

    https://doi.org/10.4018/IJAEC.2017040104

  • Dong J, Tong W, Luo T, Wang X, Hu J, Xu Y and Lin G. (2017). An FPTAS for the parallel two-stage flowshop problem. Theoretical Computer Science. 657:PA. (64-72). Online publication date: 2-Jan-2017.

    https://doi.org/10.1016/j.tcs.2016.04.046

  • Mirshekarian S and Šormaz D. (2016). Correlation of job-shop scheduling problem features with scheduling efficiency. Expert Systems with Applications: An International Journal. 62:C. (131-147). Online publication date: 15-Nov-2016.

    https://doi.org/10.1016/j.eswa.2016.06.014

  • Lin J and Zhang S. (2016). An effective hybrid biogeography-based optimization algorithm for the distributed assembly permutation flow-shop scheduling problem. Computers and Industrial Engineering. 97:C. (128-136). Online publication date: 1-Jul-2016.

    https://doi.org/10.1016/j.cie.2016.05.005

  • He H. (2016). Minimization of maximum lateness in an m-machine permutation flow shop with a general exponential learning effect. Computers and Industrial Engineering. 97:C. (73-83). Online publication date: 1-Jul-2016.

    https://doi.org/10.1016/j.cie.2016.04.010

  • Benavides A and Ritt M. (2016). Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops. Computers and Operations Research. 66:C. (160-169). Online publication date: 1-Feb-2016.

    https://doi.org/10.1016/j.cor.2015.08.001

  • (2016). Permutation flowshop group scheduling with position-based learning effect. Computers and Industrial Engineering. 92:C. (1-15). Online publication date: 1-Feb-2016.

    https://doi.org/10.1016/j.cie.2015.12.001

  • Santucci V, Baioletti M, Milani A, Mancini T, Maratea M and Ricca F. (2016). Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm. AI Communications. 29:2. (269-286). Online publication date: 1-Jan-2016.

    https://doi.org/10.3233/AIC-150695

  • Marichelvam M and Geetha M. (2016). A hybrid discrete firefly algorithm to solve flow shop scheduling problems to minimise total flow time. International Journal of Bio-Inspired Computation. 8:5. (318-325). Online publication date: 1-Jan-2016.

    https://doi.org/10.1504/IJBIC.2016.079572

  • Shiau Y, Tsai M, Lee W and Cheng T. (2015). Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time. Computers and Industrial Engineering. 87:C. (580-589). Online publication date: 1-Sep-2015.

    https://doi.org/10.1016/j.cie.2015.05.032

  • Lai P and Wu H. (2015). Using heuristic algorithms to solve the scheduling problems with job-dependent and machine-dependent learning effects. Journal of Intelligent Manufacturing. 26:4. (691-701). Online publication date: 1-Aug-2015.

    https://doi.org/10.1007/s10845-013-0827-x

  • Fotakis D, Milis I, Papadigenopoulos O, Zampetakis E and Zois G. Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors. Proceedings of the 14th International Symposium on Experimental Algorithms - Volume 9125. (137-150).

    https://doi.org/10.1007/978-3-319-20086-6_11

  • Wang J and Zhang B. (2015). Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects. Computers and Operations Research. 58:C. (24-31). Online publication date: 1-Jun-2015.

    https://doi.org/10.1016/j.cor.2014.12.006

  • Yang J. (2015). Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage. Computers and Operations Research. 58:C. (1-8). Online publication date: 1-Jun-2015.

    https://doi.org/10.1016/j.cor.2014.11.012

  • Nip K, Wang Z, Talla Nobibon F and Leus R. (2015). A combination of flow shop scheduling and the shortest path problem. Journal of Combinatorial Optimization. 29:1. (36-52). Online publication date: 1-Jan-2015.

    https://doi.org/10.1007/s10878-013-9670-4

  • Wang W, Feng C, Li B and Liang B. On the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources. Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies. (235-248).

    https://doi.org/10.1145/2674005.2675010

  • Quibell R and Strusevich V. (2014). An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order. Computers and Industrial Engineering. 76:C. (347-359). Online publication date: 1-Oct-2014.

    https://doi.org/10.1016/j.cie.2014.08.009

  • Gerstl E and Mosheiov G. (2014). The optimal number of used machines in a two-stage flexible flowshop scheduling problem. Journal of Scheduling. 17:2. (199-210). Online publication date: 1-Apr-2014.

    https://doi.org/10.1007/s10951-013-0343-z

  • Lai K, Hsu P, Ting P and Wu C. (2014). A Truncated Sum of Processing-Times-Based Learning Model for a Two-Machine Flowshop Scheduling Problem. Human Factors in Ergonomics & Manufacturing. 24:2. (152-160). Online publication date: 1-Mar-2014.

    https://doi.org/10.1002/hfm.20365

  • Dong J, Chen Y, Zhang A and Yang Q. (2013). A new three-machine shop scheduling. Journal of Combinatorial Optimization. 26:4. (799-810). Online publication date: 1-Nov-2013.

    https://doi.org/10.1007/s10878-012-9485-8

  • Rudek R. (2013). The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times. Applied Mathematics and Computation. 221:C. (819-832). Online publication date: 15-Sep-2013.

    /doi/10.5555/2745046.2745189

  • Jansen K, Land F and Land K. Bounding the running time of algorithms for scheduling and packing problems. Proceedings of the 13th international conference on Algorithms and Data Structures. (439-450).

    https://doi.org/10.1007/978-3-642-40104-6_38

  • Kuo W, Hsu C and Yang D. (2012). Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect. Information Sciences: an International Journal. 184:1. (282-297). Online publication date: 1-Feb-2012.

    https://doi.org/10.1016/j.ins.2011.08.018

  • Moghaddam A, Yalaoui F and Amodeo L. An Efficient Meta-heuristic Based on Self-control Dominance Concept for a Bi-objective Re-entrant Scheduling Problem with Outsourcing. Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219. (467-471).

    /doi/10.5555/2961491.2961539

  • Poggi M and Sotelo D. (2012). A linear time approximation algorithm for permutation flow shop scheduling. Theoretical Computer Science. 416. (87-94). Online publication date: 1-Jan-2012.

    https://doi.org/10.1016/j.tcs.2011.10.013

  • Chakraborty U and Turvey K. (2010). Floating-point to integer mapping schemes in differential evolution for permutation flow shop scheduling. International Journal of Bio-Inspired Computation. 2:3/4. (183-204). Online publication date: 1-May-2010.

    https://doi.org/10.1504/IJBIC.2010.033087

  • Mesgarpour M, Kirkavak N and Ozaktas H. Bicriteria scheduling problem on the two-machine flowshop using simulated annealing. Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization. (166-177).

    https://doi.org/10.1007/978-3-642-12139-5_15

  • Karger D, Stein C and Wein J. Scheduling algorithms. Algorithms and theory of computation handbook. (20-20).

    /doi/10.5555/1882723.1882743

  • Chakraborty U. Minimizing total flow time in permutation flow shop scheduling with improved simulated annealing. Proceedings of the Eleventh conference on Congress on Evolutionary Computation. (158-165).

    /doi/10.5555/1689599.1689620

  • Leung J and Zhao H. (2006). Minimizing Sum of Completion Times and Makespan in Master-Slave Systems. IEEE Transactions on Computers. 55:8. (985-999). Online publication date: 1-Aug-2006.

    https://doi.org/10.1109/TC.2006.128

  • Su L and Lin C. (2006). Three-machine flowshop with two operations per job to minimize makespan. Computers and Industrial Engineering. 50:3. (286-295). Online publication date: 1-Jul-2006.

    https://doi.org/10.1016/j.cie.2006.06.001

  • Jiang M. Subsequence packing. Proceedings of the Second international conference on Algorithmic Aspects in Information and Management. (314-323).

    https://doi.org/10.1007/11775096_29

  • Afrati F and Milis I. (2006). Designing PTASs for MIN-SUM scheduling problems. Discrete Applied Mathematics. 154:4. (622-639). Online publication date: 15-Mar-2006.

    /doi/10.5555/1141038.1705262

  • Li Y, Wang F and Lim A. (2004). A genetic algorithm for machine scheduling problem under shared resource constraints. International Journal of Computer Applications in Technology. 19:2. (77-83). Online publication date: 2-May-2004.

    https://doi.org/10.1504/IJCAT.2004.003636

  • (2001). Tighter bounds on preemptive job shop scheduling with two machines. Computing. 67:1. (83-90). Online publication date: 1-Sep-2001.

    https://doi.org/10.1007/s006070170017

  • Hoogeveen J and Kawaguchi T. (1999). Minimizing Total Completion Time in a Two-Machine Flowshop. Mathematics of Operations Research. 24:4. (887-910). Online publication date: 1-Nov-1999.

    /doi/10.5555/2769310.2769318

  • Chen B, Glass C, Potts C and Strusevich V. (1996). A New Heuristic for Three-Machine Flow Shop Scheduling. Operations Research. 44:6. (891-898). Online publication date: 1-Dec-1996.

    https://doi.org/10.1287/opre.44.6.891

  • Lai T. (1996). A Note on Heuristics of Flow-Shop Scheduling. Operations Research. 44:4. (648-652). Online publication date: 1-Aug-1996.

    https://doi.org/10.1287/opre.44.4.648

  • Pramanick I and Kuhl J. (1995). An Inherently Parallel Method for Heuristic Problem-Solving. IEEE Transactions on Parallel and Distributed Systems. 6:10. (1016-1028). Online publication date: 1-Oct-1995.

    https://doi.org/10.1109/71.473512

  • Pramanick I and Kuhl J. (1995). An Inherently Parallel Method for Heuristic Problem-Solving. IEEE Transactions on Parallel and Distributed Systems. 6:10. (1006-1015). Online publication date: 1-Oct-1995.

    https://doi.org/10.1109/71.473511

  • Lee C and Vairaktarakis G. (1994). Minimizing makespan in hybrid flowshops. Operations Research Letters. 16:3. (149-158). Online publication date: 1-Oct-1994.

    https://doi.org/10.1016/0167-6377(94)90026-4

  • Lee C, Cheng T and Lin B. (1993). Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem. Management Science. 39:5. (616-625). Online publication date: 1-May-1993.

    /doi/10.5555/2842434.2842442

  • Peng D and Shin K. (1993). Optimal Scheduling of Cooperative Tasks in a Distributed System Using an Enumerative Method. IEEE Transactions on Software Engineering. 19:3. (253-267). Online publication date: 1-Mar-1993.

    https://doi.org/10.1109/32.221134

  • Dudek R, Panwalkar S and Smith M. (1992). The Lessons of Flowshop Scheduling Research. Operations Research. 40:1. (7-13). Online publication date: 1-Feb-1992.

    /doi/10.5555/2896565.2896569

  • (1982). Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems. Mathematics of Operations Research. 7:4. (532-544). Online publication date: 1-Nov-1982.

    https://doi.org/10.1287/moor.7.4.532

  • Achugbue J and Chin F. (1982). Scheduling the Open Shop to Minimize Mean Flow Time. SIAM Journal on Computing. 11:4. (709-720). Online publication date: 1-Nov-1982.

    https://doi.org/10.1137/0211058

  • Graves S. (1981). A Review of Production Scheduling. Operations Research. 29:4. (646-675). Online publication date: 1-Aug-1981.

    https://doi.org/10.1287/opre.29.4.646

  • (1981). Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops. Operations Research. 29:3. (511-522). Online publication date: 1-Jun-1981.

    https://doi.org/10.1287/opre.29.3.511

  • Gouda M and Dayal U. Optimal semijoin schedules for query processing in local distributed database systems. Proceedings of the 1981 ACM SIGMOD international conference on Management of data. (164-175).

    https://doi.org/10.1145/582318.582344

  • Sahni S and Cho Y. (1979). Complexity of Scheduling Shops with No Wait in Process. Mathematics of Operations Research. 4:4. (448-457). Online publication date: 1-Nov-1979.

    https://doi.org/10.1287/moor.4.4.448

  • Sahni S and Horowitz E. (1978). Combinatorial Problems. Operations Research. 26:5. (718-759). Online publication date: 1-Oct-1978.

    https://doi.org/10.1287/opre.26.5.718