Research on the ITOC Based Solutions for Ship-Piping Jobshop Scheduling

2011 ◽  
Vol 314-316 ◽  
pp. 2046-2054
Author(s):  
Rui Li ◽  
Yu Jun Liu ◽  
Kunihiro Hamada
Keyword(s):  
Production Scheduling ◽  
Planning Process ◽  
Pipe Production ◽  
Scheduling Problems ◽  
Product Model ◽  
Knowledge Database ◽  
Master Schedule ◽  
Jobshop Scheduling ◽  
Piping Systems ◽  
Piping Factory

Manufacturing of ship piping systems is one of the major production activities in shipbuilding. The schedule of pipe production has an important impact on the master schedule of shipbuilding. In this research, the ITOC concept was introduced to solve the scheduling problems of a piping jobshop, and an intelligent scheduling system was developed. The system, in which a product model, an operation model, a factory model, and a knowledge database of piping production were integrated, automated the planning process and production scheduling. Details of the above points were discussed. Moreover, an application of the system in a piping factory, which achieved a higher level of performance as measured by tardiness, lead time, and inventory was demonstrated.

scholarly journals Realtime production scheduling and control systems in smart industry

Impact ◽  
2020 ◽  
Vol 2020 (8) ◽  
pp. 60-61
Author(s):  
Wei Weng
Keyword(s):  
Control Systems ◽  
Real Time ◽  
Production Scheduling ◽  
Production Control ◽  
Optimal Solution ◽  
Scheduling Problem ◽  
Optimal Solutions ◽  
Scheduling Problems ◽  
Smart Industry ◽  
And Control

For a production system, 'scheduling' aims to find out which machine/worker processes which job at what time to produce the best result for user-set objectives, such as minimising the total cost. Finding the optimal solution to a large scheduling problem, however, is extremely time consuming due to the high complexity. To reduce this time to one instance, Dr Wei Weng, from the Institute of Liberal Arts and Science, Kanazawa University in Japan, is leading research projects on developing online scheduling and control systems that provide near-optimal solutions in real time, even for large production systems. In her system, a large scheduling problem will be solved as distributed small problems and information of jobs and machines is collected online to provide results instantly. This will bring two big changes: 1. Large scheduling problems, for which it tends to take days to reach the optimal solution, will be solved instantly by reaching near-optimal solutions; 2. Rescheduling, which is still difficult to be made in real time by optimization algorithms, will be completed instantly in case some urgent jobs arrive or some scheduled jobs need to be changed or cancelled during production. The projects have great potential in raising efficiency of scheduling and production control in future smart industry and enabling achieving lower costs, higher productivity and better customer service.

scholarly journals 3/2-approximation algorithm for a single machine scheduling problem

2021 ◽  
Vol 17 (3) ◽  
pp. 240-253
Author(s):  
Natalia S. Grigoreva ◽  
Keyword(s):  
Approximation Algorithm ◽  
Optimization Problem ◽  
Single Machine Scheduling ◽  
Release Time ◽  
Scheduling Problem ◽  
Delivery Time ◽  
Scheduling Problems ◽  
Delivery Times ◽  
Jobshop Scheduling ◽  
Single Processor

The problem of minimizing the maximum delivery times while scheduling tasks on a single processor is a classical combinatorial optimization problem. Each task ui must be processed without interruption for t(ui) time units on the machine, which can process at most one task at time. Each task uw; has a release time r(ui), when the task is ready for processing, and a delivery time g(ui). Its delivery begins immediately after processing has been completed. The objective is to minimize the time, by which all jobs are delivered. In the Graham notation this problem is denoted by 1|rj,qi|Cmax, it has many applications and it is NP-hard in a strong sense. The problem is useful in solving owshop and jobshop scheduling problems. The goal of this article is to propose a new 3/2-approximation algorithm, which runs in O(n log n) times for scheduling problem 1|rj.qi|Cmax. An example is provided which shows that the bound of 3/2 is accurate. To compare the effectiveness of proposed algorithms, random generated problems of up to 5000 tasks were tested.

Omni Furniture Company: A Systems Development Life Cycle Case

2006 ◽  
Vol 20 (2) ◽  
pp. 81-91 ◽  
Author(s):  
David H. Sinason ◽  
Carol J. Normand
Keyword(s):  
Life Cycle ◽  
Cash Flow ◽  
Production Scheduling ◽  
Software Package ◽  
Information Needs ◽  
Systems Development ◽  
Scheduling Problems ◽  
Accounting Information Systems ◽  
Business Consulting ◽  
Development Life Cycle

The Omni Furniture Company Case was created to help students enrolled in an accounting information systems (AIS) course further their understanding of the systems development life cycle (SDLC) by thinking through all stages of the development process. Omni is a privately held company that has found a market niche by assembling several models of simple yet durable desks, tables, and chairs for use in offices. After several years in business, Omni has recently experienced tremendous growth that has resulted in cash flow and production scheduling problems. Susan and Barry Omni, the owners of the company, realize that the information system they have been using is outdated and needs to be improved. No one in the company has the time or ability to develop such a system and so a business consulting firm has been hired to develop the new system. Each business consulting team is required to (1) design a system that will solve Omni's cash flow and production scheduling information needs and (2) use an appropriate software package to actually implement the system. Teams do not design a system that processes transactions; data should be manually entered into an appropriate software package such as Access or Excel. All tables must be linked so that one change in the data affects all of the information presented in all of the reports.

Modified Migrating Birds Optimization for Solving the Low-carbon Scheduling Problem

2020 ◽  
Vol 12 (4) ◽  
pp. 63-75
Author(s):  
Zhifeng Zhang ◽  
Yusheng Sun ◽  
Yadong Cui ◽  
Haodong Zhu
Keyword(s):  
Production Scheduling ◽  
Job Shop ◽  
Optimal Solution ◽  
Scheduling Problem ◽  
Low Carbon ◽  
Scheduling Problems ◽  
Solution Quality ◽  
Migrating Birds Optimization ◽  
Initialization Scheme ◽  
Migrating Birds

Production scheduling problems have historically emphasized cycle time without involving the environmental factors. In the study, a low-carbon scheduling problem in a flexible job shop is considered to minimize the energy consumption, which mainly consists of two parts: the useful part and the wasted part. First, a mathematical model is built based on the features of the workshop. Second, a modified migrating bird's optimization (MMBO) is developed to obtain the optimal solution. In the MMBO, a population initialization scheme is designed to enhance the solution quality and convergence speed. Five types of neighborhood structures are introduced to create neighborhood solutions. Furthermore, a local search method and a reset mechanism are developed to improve the computational results. Finally, experimental results validate that the MMBO is effective and feasible.

scholarly journals Task Scheduling Model of Double-Deep Multi-Tier Shuttle System

Processes ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 604 ◽  
Author(s):  
Yanyan Wang ◽  
Rongxu Zhang ◽  
Hui Liu ◽  
Xiaoqing Zhang ◽  
Ziwei Liu
Keyword(s):  
Task Scheduling ◽  
Production Scheduling ◽  
Current System ◽  
Storage System ◽  
Complex Structure ◽  
Vertical Movement ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
High Flexibility ◽  
Shuttle System

As a new type of part-to-picker storage system, the double-deep multi-tier shuttle system has been developed rapidly in the e-commerce industry because of its high flexibility, large storage capacity, and robustness. The system consists of a multi-tier shuttle sub-system that controls horizontal movement and a lift sub-system that manages vertical movement. The combination of shuttles and lifts, instead of a stacker crane in conventional automated storage and retrieval system, undertakes inbound/outbound tasks. Because of the complex structure and numerous equipment of the system, task scheduling has become a major difficulty in the outbound operation of the double-deep multi-tier shuttle system. Figuring out methods to improve the overall efficiency of task scheduling operations is the focus of current system application enterprises. This paper introduces the task scheduling problem for the shuttle system. Inspired from workshop production scheduling problems, we minimize the total time of a batch of retrieval tasks as the objective function, applying the modified Simulated Annealing Algorithms (SAAs) to solve the task scheduling problem. In conclusion, we verified the proposed model and the algorithm efficiency, using case studies.

Steelmaking-Hot Rolling Scheduling Model and Method for Integrated Management in Iron and Steel Enterprises

2013 ◽  
Vol 860-863 ◽  
pp. 3094-3099 ◽  
Author(s):  
Bao Lin Zhu ◽  
Shou Feng Ji
Keyword(s):  
Production Scheduling ◽  
Integrated Management ◽  
Steel Production ◽  
Optimal Solution ◽  
Scheduling Problems ◽  
Planning And Scheduling ◽  
Iron And Steel ◽  
Scheduling Model ◽  
General Production ◽  
Iron And Steel Production

Iron and steel production scheduling problems are different from general production scheduling in machine industry. They have to meet special demands of steel production process. The CCR production manner dramatically promotes the revolution in technology and management, especially to planning and scheduling. In this paper, a scheduling model is presented to integrate the three working procedures and the lagrangian relaxation technology is proposed to get the optimal solution of the scheduling model. Finally, numerical examples are given to demonstrate the effectiveness of the integrated model and method.

Sign in / Sign up

Export Citation Format

Share Document