Citations (25)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (2)
Shi Qiang Liu, Erhan Kozan, Mahmoud Masoud, Yu Zhang & Felix T.S. Chan. (2018) Job shop scheduling with a combination of four buffering constraints. International Journal of Production Research 56:9, pages 3274-3293.
Read now
Read now
Myungho Lee, Kyungduk Moon, Kangbok Lee, Juntaek Hong & Michael Pinedo. A critical review of planning and scheduling in steel-making and continuous casting in the steel industry. Journal of the Operational Research Society 0:0, pages 1-35.
Read now
Read now
Articles from other publishers (23)
Yejian Zhao, Xiaochuan Luo & Yulin Zhang. (2024) The application of heterogeneous graph neural network and deep reinforcement learning in hybrid flow shop scheduling problem. Computers & Industrial Engineering 187, pages 109802.
Crossref
Crossref
Benno Hoch & Frauke Liers. (2022) An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization. Optimization and Engineering 24:2, pages 1017-1055.
Crossref
Crossref
Pengyu Zhang, Shiji Song, Shengsheng Niu & Rui Zhang. (2022) A Hybrid Artificial Immune-Simulated Annealing Algorithm for Multiroute Job Shop Scheduling Problem With Continuous Limited Output Buffers. IEEE Transactions on Cybernetics 52:11, pages 12112-12125.
Crossref
Crossref
Marek Vlk, Kateřina Brejchová, Zdeněk Hanzálek & Siyu Tang. (2022) Large-scale periodic scheduling in time-sensitive networks. Computers & Operations Research 137, pages 105512.
Crossref
Crossref
Yunus DEMİR. (2021) Tekrarlı Açgözlü Algoritma Üzerine Kapsamlı Bir AnalizA Comprehensive Analysis on the Iterated Greedy Algorithm. Iğdır Üniversitesi Fen Bilimleri Enstitüsü Dergisi 11:4, pages 2716-2728.
Crossref
Crossref
Wenyu Zhang, Jiepin Ding, Yan Wang, Shuai Zhang & Xiaoyu Zhuang. (2020) Energy-efficient bi-objective manufacturing scheduling with intermediate buffers using a three-stage genetic algorithm. Journal of Intelligent & Fuzzy Systems 39:1, pages 289-304.
Crossref
Crossref
A.K. Takmazian, N.A. Kuznetsov & A.V. Syrovatko. (2019) Classical Approximation to Networks of Nonstandard Reachability in Relation to Locomotive Assignment Problem. Classical Approximation to Networks of Nonstandard Reachability in Relation to Locomotive Assignment Problem.
Александр Борисович Шабунин & Андрей Куркенович Такмазьян. (2019) Application of the optimal network flow method to the problem of locomotive selection for freight trains on the Eastern Polygon. Вычислительные технологии:6(23), pages 94-106.
Crossref
Crossref
Georgios M. Kopanos & Luis PuigjanerGeorgios M. Kopanos & Luis Puigjaner. 2019. Solving Large-Scale Production Scheduling and Planning in the Process Industries. Solving Large-Scale Production Scheduling and Planning in the Process Industries
9
55
.
A.K. Takmazian, A.B. Shabunin & V.G. Matyukhin. (2018) Solution of Locomotive Assignment Problem by Network Flow Approach. Solution of Locomotive Assignment Problem by Network Flow Approach.
Taomei Zhu & Jose Manuel Mera Sanchez de Pedro. (2017) Railway Traffic Conflict Detection via a State Transition Prediction Approach. IEEE Transactions on Intelligent Transportation Systems 18:5, pages 1268-1278.
Crossref
Crossref
Marco Pranzo & Dario Pacciarelli. (2015) An iterated greedy metaheuristic for the blocking job shop scheduling problem. Journal of Heuristics 22:4, pages 587-611.
Crossref
Crossref
Dario Pacciarelli & Andrea D’Ariano. (2011) Increasing the Reliability of Production Schedules in a Pharmaceutical Packaging Department. Journal of Medical Systems 36:6, pages 3407-3421.
Crossref
Crossref
Jie Li, Xin Xiao, Qiuhua Tang & Christodoulos A. Floudas. (2012) Production Scheduling of a Large-Scale Steelmaking Continuous Casting Process via Unit-Specific Event-Based Continuous-Time Models: Short-Term and Medium-Term Scheduling. Industrial & Engineering Chemistry Research 51:21, pages 7300-7319.
Crossref
Crossref
Tao Wu, Ke Lin, Jianjie Wu, Xiaobing Pei & Qiang Peng. (2012) A top-down design process oriented adaptive conceptual layout design environment based on semantic norm model. A top-down design process oriented adaptive conceptual layout design environment based on semantic norm model.
Dario Pacciarelli, Carlo Meloni & Marco Pranzo. 2011. Planning Production and Inventories in the Extended Enterprise. Planning Production and Inventories in the Extended Enterprise
429
459
.
Georgios M. Kopanos, Carlos A. Méndez & Luis Puigjaner. (2010) MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: A benchmark scheduling problem of the pharmaceutical industry. European Journal of Operational Research 207:2, pages 644-655.
Crossref
Crossref
Luca Venditti, Dario Pacciarelli & Carlo Meloni. (2010) A tabu search algorithm for scheduling pharmaceutical packaging operations. European Journal of Operational Research 202:2, pages 538-546.
Crossref
Crossref
Heinz Gröflin & Andreas Klinkert. (2009) A new neighborhood and tabu search for the Blocking Job Shop. Discrete Applied Mathematics 157:17, pages 3643-3655.
Crossref
Crossref
D. Pacciarelli & A. D'Ariano. (2009) Assessing the value of RFID in pharmaceutical production scheduling. IFAC Proceedings Volumes 42:4, pages 1096-1101.
Crossref
Crossref
Heinz Gröflin & Andreas Klinkert. (2007) Feasible insertions in job shop scheduling, short cycles and stable sets. European Journal of Operational Research 177:2, pages 763-785.
Crossref
Crossref
Tao Sun, P.B. Luh & Min Liu. (2006) Lagrangian relaxation for complex job shop scheduling. Lagrangian relaxation for complex job shop scheduling.
Dario Pacciarelli & Marco Pranzo. (2004) Production scheduling in a steelmaking-continuous casting plant. Computers & Chemical Engineering 28:12, pages 2823-2835.
Crossref
Crossref