129
Views
46
CrossRef citations to date
0
Altmetric
ORIGINAL ARTICLES

Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems

&
Pages 1085-1097 | Received 01 Sep 1995, Accepted 01 Jan 1998, Published online: 31 May 2007

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

Read on this site (9)

Dmitry Ivanov, Boris Sokolov, Weiwei Chen, Alexandre Dolgui, Frank Werner & Semyon Potryasaev. (2021) A control approach to scheduling flexibly configurable jobs with dynamic structural-logical constraints. IISE Transactions 53:1, pages 21-38.
Read now
Gregory Steeger, Timo Lohmann & Steffen Rebennack. (2018) Strategic bidding for a price-maker hydroelectric producer: Stochastic dual dynamic programming and Lagrangian relaxation. IISE Transactions 50:11, pages 929-942.
Read now
Hongwei Ge, Liang Sun, Xin Chen & Yanchun Liang. (2016) An Efficient Artificial Fish Swarm Model with Estimation of Distribution for Flexible Job Shop Scheduling. International Journal of Computational Intelligence Systems 9:5, pages 917-931.
Read now
Myoungsoo Ham, Young Hoon Lee & Sun Hoon Kim. (2011) Real-time scheduling of multi-stage flexible job shop floor. International Journal of Production Research 49:12, pages 3715-3730.
Read now
Xiaoming Feng & Yuan Liao. (2006) A New Lagrangian Multiplier Update Approach for Lagrangian Relaxation Based Unit Commitment. Electric Power Components and Systems 34:8, pages 857-866.
Read now
L Tang & H Xuan. (2006) Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers. Journal of the Operational Research Society 57:3, pages 316-324.
Read now
Dong Chen, PeterB. Luh, LakshmanS. Thakur & Jack Moreno$suffix/text()$suffix/text(). (2003) Optimization-based manufacturing scheduling with multiple resources, setup requirements, and transfer lots. IIE Transactions 35:10, pages 973-985.
Read now
YUANHUI ZHANG, PETERB. LUH, KIYOSHI YONEDA, TOSHIYUKI KANO & YUJI KYOYA. (2000) Mixed-model assembly line scheduling using the Lagrangian relaxation technique. IIE Transactions 32:2, pages 125-134.
Read now

Articles from other publishers (37)

Gaohong Zhu & Dianting Liu. (2023) Modeling and IAHA Solution for Task Scheduling Problem of Processing Crowdsourcing in the Context of Social Manufacturing. Systems 11:8, pages 383.
Crossref
Mikhail A. Bragin. (2023) Survey on Lagrangian relaxation for MILP: importance, challenges, historical review, recent advancements, and opportunities. Annals of Operations Research.
Crossref
M. Hajibabaei & J. Behnamian. (2023) Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation. Journal of Combinatorial Optimization 45:5.
Crossref
In-Jae Jeong. (2023) A review of decentralized optimization focused on information flows of decomposition algorithms. Computers & Operations Research 153, pages 106190.
Crossref
Liangliang Sun. (2022) An Efficient and Effective Approach for the Scheduling of Steelmaking-continuous Casting Process With Multi Different Refining Routes. IEEE Robotics and Automation Letters 7:4, pages 10454-10461.
Crossref
Young Hoon Lee & Seunghoon Lee. (2022) Deep reinforcement learning based scheduling within production plan in semiconductor fabrication. Expert Systems with Applications 191, pages 116222.
Crossref
Minoru Kobayashi. (2021) Application of the surrogate gradient method for a multi-item single-machine dynamic lot size scheduling problem. SN Applied Sciences 3:7.
Crossref
Jiri Stastny, Vladislav Skorpil, Zoltan Balogh & Richard Klein. (2021) Job Shop Scheduling Problem Optimization by Means of Graph-Based Algorithm. Applied Sciences 11:4, pages 1921.
Crossref
Bing Yan, Mikhail A. Bragin & Peter B. Luh. (2020) Tightened Formulation and Resolution of Energy-Efficient Job-Shop Scheduling. Tightened Formulation and Resolution of Energy-Efficient Job-Shop Scheduling.
Fei Luan, Zongyan Cai, Shuqiang Wu, Shi Qiang Liu & Yixin He. (2019) Optimizing the Low-Carbon Flexible Job Shop Scheduling Problem with Discrete Whale Optimization Algorithm. Mathematics 7:8, pages 688.
Crossref
Bing Yan, Mikhail A. Bragin & Peter B. Luh. (2018) Novel Formulation and Resolution of Job-Shop Scheduling Problems. IEEE Robotics and Automation Letters 3:4, pages 3387-3393.
Crossref
Reinhard Bürgy & Kerem Bülbül. (2018) The job shop scheduling problem with convex costs. European Journal of Operational Research 268:1, pages 82-100.
Crossref
Gregory Steeger & Steffen Rebennack. (2017) Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: An application to the strategic bidding problem. European Journal of Operational Research 257:2, pages 669-686.
Crossref
Ge Hongwei & Sun Liang. (2016) Intelligent scheduling in flexible job shop environments based on artificial fish swarm algorithm with estimation of distribution. Intelligent scheduling in flexible job shop environments based on artificial fish swarm algorithm with estimation of distribution.
Jianfeng Zheng, Qiang Meng & Zhuo Sun. (2014) Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design. European Journal of Operational Research 234:3, pages 874-884.
Crossref
Congcong Wang, Tengshun Peng, Peter B. Luh, Paul Gribik & Li Zhang. (2013) The Subgradient Simplex Cutting Plane Method for Extended Locational Marginal Prices. IEEE Transactions on Power Systems 28:3, pages 2758-2767.
Crossref
Jingyang Xu & R. Nagi. (2013) Solving assembly scheduling problems with tree-structure precedence constraints: A Lagrangian relaxation approach. IEEE Transactions on Automation Science and Engineering 10:3, pages 757-771.
Crossref
Geoffrey J. Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Ajay S. Aravamudhan & Shih-Fen Cheng. (2012) Lagrangian Relaxation for Large-Scale Multi-agent Planning. Lagrangian Relaxation for Large-Scale Multi-agent Planning.
Han Yunjun, Yan Xiangdong & Wang Dan. (2012) Lagrangian relaxation based Feasible Solution Algorithm. Lagrangian relaxation based Feasible Solution Algorithm.
Yunjun Han, Xiaohong Guan & Leyuan Shi. (2011) Optimization Based Method for Supply Location Selection and Routing in Large-Scale Emergency Material Delivery. IEEE Transactions on Automation Science and Engineering 8:4, pages 683-693.
Crossref
Wang Lingli & Zhang Xingchen. (2011) Optimization model and algorithm for routing railway wagon-flow oriented to district load balance. Optimization model and algorithm for routing railway wagon-flow oriented to district load balance.
Michael Caramanis & Justin M. Foster. (2009) Management of electric vehicle charging to mitigate renewable generation intermittency and distribution network congestion. Management of electric vehicle charging to mitigate renewable generation intermittency and distribution network congestion.
Shujun Jiang & Lixin Tang. (2008) Lagrangian Relaxation Algorithms for Re-entrant Hybrid Flowshop Scheduling. Lagrangian Relaxation Algorithms for Re-entrant Hybrid Flowshop Scheduling.
Hong-Wei Ge, Liang Sun, Yan-Chun Liang & Feng Qian. (2008) An Effective PSO and AIS-Based Hybrid Intelligent Algorithm for Job-Shop Scheduling. IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans 38:2, pages 358-368.
Crossref
Philippe Baptiste, Marta Flamini & Francis Sourd. (2008) Lagrangian bounds for just-in-time job-shop scheduling. Computers & Operations Research 35:3, pages 906-915.
Crossref
Amit Kumar Gupta & Appa Iyer Sivakumar. (2004) Job shop scheduling techniques in semiconductor manufacturing. The International Journal of Advanced Manufacturing Technology 27:11-12, pages 1163-1169.
Crossref
Tao Sun, P.B. Luh & Min Liu. (2006) Lagrangian relaxation for complex job shop scheduling. Lagrangian relaxation for complex job shop scheduling.
Xiaoming Feng & Yuan Liao. (2005) Latest experiences in improving convergence of dual optimization in LR method. Latest experiences in improving convergence of dual optimization in LR method.
Kerem Bülbül, Philip Kaminsky & Candace Yano. (2004) Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs. Naval Research Logistics (NRL) 51:3, pages 407-445.
Crossref
Kostas S. Metaxiotis, John E. Psarras & Kostas A. Ergazakis. (2003) Production scheduling in ERP systems. Business Process Management Journal 9:2, pages 221-247.
Crossref
P.B. Luh & Weidong Feng. (2003) From manufacturing scheduling to supply chain coordination: the control of complexity and uncertainty. From manufacturing scheduling to supply chain coordination: the control of complexity and uncertainty.
M.C. Caramanis, O.M. Anli & I.C. Paschalidis. (2003) Supply chain (SC) production planning with dynamic lead time and quality of service constraints. Supply chain (SC) production planning with dynamic lead time and quality of service constraints.
Kostas S. Metaxiotis, John E. Psarras & Dimitris T. Askounis. (2002) GENESYS: an expert system for production scheduling. Industrial Management & Data Systems 102:6, pages 309-317.
Crossref
Byoung-Woon Kim & Chong-Min Kyung. (2002) Exploiting intellectual properties with imprecise design costs for system-on-chip synthesis. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 10:3, pages 240-252.
Crossref
P.B. Luh, Xing Zhao, Yajun Wang & L.S. Thakur. (2000) Lagrangian relaxation neural networks for job shop scheduling. IEEE Transactions on Robotics and Automation 16:1, pages 78-88.
Crossref
Xing Zhao & P.B. Luh. (1998) Fuzzy gradient method in Lagrangian relaxation for integer programming problems. Fuzzy gradient method in Lagrangian relaxation for integer programming problems.
Peter B. Luh. 1998. Control Problems in Robotics and Automation. Control Problems in Robotics and Automation 227 243 .

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.