Author: Manmohan Mehra
Publisher:
ISBN:
Category : Machine shops
Languages : en
Pages : 294
Book Description
An Experimental Investigation of Job Shop Scheduling with Assembly Constraints
Naval Research Logistics Quarterly
Author:
Publisher:
ISBN:
Category : Logistics, Naval
Languages : en
Pages : 1262
Book Description
Publisher:
ISBN:
Category : Logistics, Naval
Languages : en
Pages : 1262
Book Description
Journal of Operations Management
Author: American production and inventory control society
Publisher:
ISBN:
Category :
Languages : en
Pages : 470
Book Description
Publisher:
ISBN:
Category :
Languages : en
Pages : 470
Book Description
An Experimental Investigation of Information Use in a Job Shop Operating Under Dual Resource Constraints
Author: Lawrence Dean Fredendall
Publisher:
ISBN:
Category : Production control
Languages : en
Pages : 602
Book Description
Publisher:
ISBN:
Category : Production control
Languages : en
Pages : 602
Book Description
Proceedings Of 17th All India Manufacturing Technology
Author:
Publisher: Allied Publishers
ISBN: 9788170236276
Category :
Languages : en
Pages : 746
Book Description
Publisher: Allied Publishers
ISBN: 9788170236276
Category :
Languages : en
Pages : 746
Book Description
Proceedings of the Tenth International Conference on Management Science and Engineering Management
Author: Jiuping Xu
Publisher: Springer
ISBN: 9811018375
Category : Business & Economics
Languages : en
Pages : 1697
Book Description
This book presents the proceedings of the Tenth International Conference on Management Science and Engineering Management (ICMSEM2016) held from August 30 to September 02, 2016 at Baku, Azerbaijan and organized by the International Society of Management Science and Engineering Management, Sichuan University (Chengdu, China) and Ministry of Education of Azerbaijan. The aim of conference was to foster international research collaborations in management science and engineering management as well as to provide a forum to present current research findings. The presented papers were selected and reviewed by the Program Committee, made up of respected experts in the area of management science and engineering management from around the globe. The contributions focus on identifying management science problems in engineering, innovatively using management theory and methods to solve engineering problems effectively and establishing novel management theories and methods to address new engineering management issues.
Publisher: Springer
ISBN: 9811018375
Category : Business & Economics
Languages : en
Pages : 1697
Book Description
This book presents the proceedings of the Tenth International Conference on Management Science and Engineering Management (ICMSEM2016) held from August 30 to September 02, 2016 at Baku, Azerbaijan and organized by the International Society of Management Science and Engineering Management, Sichuan University (Chengdu, China) and Ministry of Education of Azerbaijan. The aim of conference was to foster international research collaborations in management science and engineering management as well as to provide a forum to present current research findings. The presented papers were selected and reviewed by the Program Committee, made up of respected experts in the area of management science and engineering management from around the globe. The contributions focus on identifying management science problems in engineering, innovatively using management theory and methods to solve engineering problems effectively and establishing novel management theories and methods to address new engineering management issues.
Handbook of combinatorial optimization
Author: Dingzhu Du
Publisher: Springer Science & Business Media
ISBN: 9780792352853
Category : Science
Languages : en
Pages : 880
Book Description
Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dual heuristics)."
Publisher: Springer Science & Business Media
ISBN: 9780792352853
Category : Science
Languages : en
Pages : 880
Book Description
Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dual heuristics)."
A neutrosophic set-based TLBO algorithm for the flexible job-shop scheduling problem with routing flexibility and uncertain processing times
Author: Liangliang Jin
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 21
Book Description
Different with the plain flexible job-shop scheduling problem (FJSP), the FJSP with routing flexibility is more complex and it can be deemed as the integrated process planning and (job shop) scheduling (IPPS) problem, where the process planning and the job shop scheduling two important functions are considered as a whole and optimized simultaneously to utilize the flexibility in a flexible manufacturing system. Although, many novel meta-heuristics have been introduced to address this problem and corresponding fruitful results have been observed; the dilemma in real-life applications of resultant scheduling schemes stems from the uncertainty or the nondeterminacy in processing times, since the uncertainty in processing times will disturb the predefined scheduling scheme by influencing unfinished operations. As a result, the performance of the manufacturing system will also be deteriorated. Nevertheless, research on such issue has seldom been considered before. This research focuses on the modeling and optimization method of the IPPS problem with uncertain processing times. The neutrosophic set is first introduced to model uncertain processing times. Due to the complexity in the math model, we developed an improved teaching-learning-based optimization(TLBO) algorithm to capture more robust scheduling schemes.
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 21
Book Description
Different with the plain flexible job-shop scheduling problem (FJSP), the FJSP with routing flexibility is more complex and it can be deemed as the integrated process planning and (job shop) scheduling (IPPS) problem, where the process planning and the job shop scheduling two important functions are considered as a whole and optimized simultaneously to utilize the flexibility in a flexible manufacturing system. Although, many novel meta-heuristics have been introduced to address this problem and corresponding fruitful results have been observed; the dilemma in real-life applications of resultant scheduling schemes stems from the uncertainty or the nondeterminacy in processing times, since the uncertainty in processing times will disturb the predefined scheduling scheme by influencing unfinished operations. As a result, the performance of the manufacturing system will also be deteriorated. Nevertheless, research on such issue has seldom been considered before. This research focuses on the modeling and optimization method of the IPPS problem with uncertain processing times. The neutrosophic set is first introduced to model uncertain processing times. Due to the complexity in the math model, we developed an improved teaching-learning-based optimization(TLBO) algorithm to capture more robust scheduling schemes.
Advances in Manufacturing Processes, Intelligent Methods and Systems in Production Engineering
Author: Andre Batako
Publisher: Springer Nature
ISBN: 3030905322
Category : Technology & Engineering
Languages : en
Pages : 788
Book Description
This book forms an excellent basis for the development of intelligent manufacturing system for Industry 4.0, digital and distributed manufacturing, and factories for future. This book of new developments and advancement in intelligent control and optimization system for production engineering serves as a good companion to scholars, manufacturing companies, and RTO to improve the efficiency of production systems.
Publisher: Springer Nature
ISBN: 3030905322
Category : Technology & Engineering
Languages : en
Pages : 788
Book Description
This book forms an excellent basis for the development of intelligent manufacturing system for Industry 4.0, digital and distributed manufacturing, and factories for future. This book of new developments and advancement in intelligent control and optimization system for production engineering serves as a good companion to scholars, manufacturing companies, and RTO to improve the efficiency of production systems.
JSME International Journal
Author:
Publisher:
ISBN:
Category : Mechanical engineering
Languages : en
Pages : 1248
Book Description
Publisher:
ISBN:
Category : Mechanical engineering
Languages : en
Pages : 1248
Book Description