Allocating non-unitary resources in a constraint-based scheduler

被引:0
|
作者
Gini, G [1 ]
Zaraga, F [1 ]
Sioli, MC [1 ]
机构
[1] ZARAGA ENGN,MILAN,ITALY
来源
INTERNATIONAL JOURNAL OF EXPERT SYSTEMS | 1996年 / 9卷 / 04期
关键词
Algorithms - Automation - Constraint theory - Industrial plants - Just in time production - Personal computers - Problem solving - Production - Programmable logic controllers - Real time systems - Scheduling - Supervisory personnel;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The new flexibility of industrial plants increases managerial and organizational problems. The number of alternatives increases, the mix of products grows, each product can be manufactured on different machines, the trend towards just-in-time production requires that the system react quickly, and reduces the temporal intervals for where to allocate activities. So the ''only manual'' approach to scheduling is inadequate. However, the present level of knowledge and expertise and the solutions so far used should be carefully considered. From this consideration we propose an architecture that could, in a smooth way, integrate the present solution and organization with new knowledge formulation and problem solving strategies. We have studied the organization of an Italian company that produces shoe soles for the world market. The high mix of products and the flexibility required by the production facilities impact on the scheduling activity. Here, scheduling could be initially approached as a one-machine problem, where the machine is the curing press and has a non-unitary capacity. The allocation of this machine is governed by many constraints that account for a great variety of conditions, both technological and organizational. We have defined the scheduling and resource allocation problem as a constraint satisfaction problem. We have provided a solution algorithm that orders the constraints and applies constraint checking. We have integrated the scheduling system with the existent PLC automation and with the central data and central processor. The result is a real-time system, running on a PC, and producing the schedules for the next seven days. The scheduler is routinely called once a day, to take into account the data about real production. The production manager can call it in case of disrupting events. Finally, we discuss the implementation and testing of our system.
引用
收藏
页码:481 / 498
页数:18
相关论文
共 50 条
  • [41] Non-unitary evolutions of noncommutative worlds with symmetry
    Sasakura, N
    JOURNAL OF HIGH ENERGY PHYSICS, 2004, (01):
  • [42] Entanglement dynamics of the non-unitary holographic channel
    Kanato Goto
    Masahiro Nozaki
    Kotaro Tamaoka
    Mao Tian Tan
    Journal of High Energy Physics, 2023
  • [43] Biphoton transmission through non-unitary objects
    Reichert, Matthew
    Defienne, Hugo
    Sun, Xiaohang
    Fleischer, Jason W.
    JOURNAL OF OPTICS, 2017, 19 (04)
  • [44] CT for non-unitary CFTs in higher dimensions
    Osborn, Hugh
    Stergiou, Andreas
    JOURNAL OF HIGH ENERGY PHYSICS, 2016, (06):
  • [45] Symplectic codes over a non-unitary ring
    Manseri, Sarra
    Betty, Rowena Alma
    Galvez, Lucky
    Sole, Patrick
    JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2025,
  • [46] A non-unitary bulk-boundary correspondence: Non-unitary Haagerup RCFTs from S-fold SCFTs
    Gang, Dongmin
    Kim, Dongyeob
    Lee, Sungjay
    SCIPOST PHYSICS, 2024, 17 (02):
  • [47] An ancilla-based quantum simulation framework for non-unitary matrices
    Daskin, Ammar
    Kais, Sabre
    QUANTUM INFORMATION PROCESSING, 2017, 16 (01)
  • [48] GEOMETRIC PHASES FOR MIXED STATES DURING UNITARY AND NON-UNITARY EVOLUTIONS
    Pati, Arun K.
    INTERNATIONAL JOURNAL OF QUANTUM INFORMATION, 2003, 1 (01) : 135 - 152
  • [49] Unitary and non-unitary differential space-frequency coded OFDM
    Zeydan, Engin
    Kivanc, Didem
    Tureli, Uf
    WCNC 2008: IEEE WIRELESS COMMUNICATIONS & NETWORKING CONFERENCE, VOLS 1-7, 2008, : 319 - +
  • [50] Optimal computation with non-unitary quantum walks
    Kendon, Viv
    Maloyer, Olivier
    THEORETICAL COMPUTER SCIENCE, 2008, 394 (03) : 187 - 196