MURAKAMI,Yoshihiro - Faculty of Engineering Science Department of Mechanical Engineering

MURAKAMI, Yoshihiro

Faculty, Department/Institute

Faculty of Engineering Science Department of Mechanical Engineering

Academic status (qualification)

Lecturer Apr. 1,2000

Undergraduate Degrees・University

Kyoto University Faculty of EngineeringDepartment of Chemical Engineering 1990 Graduated

Graduate Degrees・University

Kyoto University Doctor's Degree Program 1994 Withdrawal

Academic Degrees

Master of Engineering Mar. 1992
Doctor of Engineering (Kyoto University) Nov. 1998 Kyoto University

Homepage Address, E-mail Address

Homepage Address：https://mura-01.my.canva.site/
Homepage Address2：https://note.com/t940085/n/na5234169bbb7

Research fields	keyword
Mathematical programming	nurse scheduling;shift scheduling;production scheduling
Production system engineering
Dynamics/Control
Intelligent mechanics/Mechanical systems

research topic	Combinatorial optimization for solving the problem of industrial machine processes
Study theme state	Joint Research within Institution
research duration
Research Programs
keyword	Constraint Satisfation Problem,Integer programming,Combinatorial Optimization,
Research field
Research Topics Overview

research topic	Shift scheduling of welfare facilities
Study theme state	Individual Research
research duration
Research Programs
keyword	Estimation of Work Load,Circadian Rhythm,Data-mining,
Research field
Research Topics Overview

所属学会・団体名	役職名 (役職在任期間)
The Society of Chemical Engineers, Japan
The Institute of Systems, Control and Information Engineers
The Japan Society of Mechanical Engineers
Japan Society for the Promotion of Science
Scheduling Society of Japan
The Society of Instrument and Control Engineers

Research Publications

No.	Type of publication	Date of publication (Date of presentation)	Title	Type of research result	Jointly authored or single authored	Publisher and journal name	Volume number
1	Presentations99	2006/10～2006,10,,,,	Dynamical Locomotion Analysis and a Model for Peristaltic Motion of Earthworms	Academic Journal	Co-author	SICE－ICASE International Joint Conference 2006	4224－4229
2	Presentations99	2005/3/19～2005,03,19,,,	High Efficiency in a Bag-packing Algorithm for Achieving Desired Sum Weight by Adding Input Materials -About Limit Weight in Addition-	Academic Journal	Co-author
3	Presentations99	2005/3/7～2005,03,07,,,	Modeling and Vibration Analysis for Tension Control of Hanging Cloth	Academic Journal	Co-author		p.１５１―１５２
4	Research report21	2005/3～2005,03,,,,	Reducing the number of long-term items: Optimal strategy for a bag-packing problem	In-house publication	Co-author	Technology Reports of Kansai University	47
5	Presentations99	2004/11～2004,11,,,,	Study on Robot Task of Folding Clothes based on RECS Concept	Academic Journal	Co-author	Proceedings of International Conference on Machine Automation	57‐62
6	Presentations99	2004/11～2004,11,,,,	Development of a Welfare Robot based on RECS Concept‐Task of Setting a Meal on the Table‐	Academic Journal	Co-author	Proceedings of International Conference on Machine Automation	81‐84
7	Presentations99	2004/11～2004,11,,,,	Development of a Micro Tactile Sensor utilizing Piezoresistors and Characterization of its Performance	Academic Journal	Co-author	Proceedings of International Conference on Machine Automation	193‐196
8	Presentations99	2004/11～2004,11,,,,	Microfabrication of a Parylene Suspended Structure and Investigation of Its Resonant Frequency	Academic Journal	Co-author	Proceedings of International Conference on Machine Automation	207‐210
9	Presentations99	2004/11～2004,11,,,,	Fabrication of a Micro Needle made of Biodegradable Polymer Material	Academic Journal	Co-author	Proceedings of International Conference on Machine Automation	211‐214
10	Presentations99	2004/3～2004,03,,,,	High Efficiency in a Bag-packing Algorithm for Achieving Desired Sum Weight by Adding input Materials	Academic Journal	Co-author
11	Papers1	2003/12～2003,12,,,,	Efficient Algorithm for Solving a Bag-packing Problem by Excluding Search Space	Academic Journal	Co-author	Transaction of the Japan Society of Mechanical Engineers
12	Papers1	2003/10～2003,10,,,,	Raising the Rate of Feasible Solutions in a Bag-Packing Problem (By Dividing Input Materials into Groups of Lighter Items and Heavier Ones)	Academic Journal	Co-author	Transactions of the Japan Society of Mechanical Engineers
13	Presentations99	2002/10～2002,10,,,,	Reducing the number of dumping items and efficient algorithm of searching in a bag-packing problem	Academic Journal	Co-author
14	Papers1	2002/9～2002,09,,,,	Characterization of Infeasible Solutions in a Bag-Packing Problem for Achieving Desired Weight	Academic Journal	Co-author	T. SICE
15	Papers1	2002/6～2002,06,,,,	Reduction of Thermo-Acoustic Self-Sustained Oscillation Noise by Giving Exciting Frequency Signal	Academic Journal	Co-author	Transactions of the Japan Society of Mechanical Engineering
16	Presentations99	2000/8～2000,08,,,,	Algorithms of Bag-packing Problem for Achieving Desired Weight with a Computerized Scale	Academic Journal	Co-author
17	Papers1	1999/10～1999,10,,,,	SA-Based Scheduling Algorithm for Increasing Probability of Selecting Promising Schedules	Academic Journal	Co-author	Journal of Chemical Engineering of Japan
18	Presentations99	1999/10～1999,10,,,,	Combinatorial Optimization in the Operation of Bag-packing for Achieving Desired Weight	Academic Journal	Co-author
19	Papers1	1999/7～1999,07,,,,	Scheduling Algorithm Using Repetitive SA Method Allocating Jobs to Desirable Production Lines	Academic Journal	Co-author
20	Papers1	1998/7～1998,07,,,,	Scheduling Algorithm Searching Only the Feasible Production Sequences for Complex Batch Processes with Storage Tanks	Academic Journal	Co-author
21	Presentations99	1997/5～1997,05,,,,	Application of Repetitive SA Method to Scheduling Problems of Chemical Processes	Academic Journal	Co-author	Computers&Chemical Engineering
22	Papers1	1997/3～1997,03,,,,	Application of Repetitive SA Method to Scheduling Problems of Chemical Processes	Academic Journal	Co-author	Transactions of the Institute of Systems, Control and Information Engineers
23	Papers1	1996/4～1996,04,,,,	A Flexible Simulation System for Scheduling with Various Constraints	Academic Journal	Co-author	Journal of Chemical Engineering of Japan

Academic presentationOtherCo-authorMURAKAMI,Yoshihiro;;;;;2012/9～

Academic presentationOtherCo-authorMURAKAMI,Yoshihiro;;;;2012/3～

PapersAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;2011/4～

Academic presentationOtherCo-authorMURAKAMI,Yoshihiro;;;;2011/3～

Academic presentationOtherCo-authorMURAKAMI,Yoshihiro;;;;;;;;;;;;;;;2011/1～

Academic presentationOtherCo-authorMURAKAMI,Yoshihiro;;;2010/9～

PapersAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;;2010/7～

PapersAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;;;2010/7～

Academic presentationOtherCo-authorMURAKAMI,Yoshihiro;;;;2010/3～

Academic presentationOtherCo-authorMURAKAMI,Yoshihiro;;;;;2010/3～

Academic presentationAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;;;;2009/3～

PapersAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2008/7～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2008/5～

In-house publicationCo-authorMURAKAMI,Yoshihiro;;;;2008/3～

In-house publicationCo-authorMURAKAMI,Yoshihiro;;;;;;;2008/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;;2008/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;;;2008/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2008/3～

PresentationsIn-house publicationCo-authorMURAKAMI,Yoshihiro;;;;;;2008/1～

OtherCo-authorMURAKAMI,Yoshihiro;;;;;;2008～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2007/9～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;;2007/9～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2007/5～

PapersAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2007/4～

In-house publicationCo-authorMURAKAMI,Yoshihiro;;;;2007/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;;;2007/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;;2007/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2007/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;;2007/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;;;2007/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;;2007/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2007/1/17～

PapersAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2006/12～

OtherSingle-AuthorMURAKAMI,Yoshihiro;2006/11～

OtherSingle-AuthorMURAKAMI,Yoshihiro;2006/10～

PresentationsDynamical Locomotion Analysis and a Model for Peristaltic Motion of EarthwormsAcademic JournalCo-authorY. Murakami;H. Uchiyama;J. Kurata;M. Maeda;SICE－ICASE International Joint Conference 20064224－42292006/10～SICE－ICCAS 2006Korea

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2006/9～

PapersAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2006/8～

PapersAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2006/6～

PapersAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2006/5～

PapersAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2006/3～

OtherCo-authorMURAKAMI,Yoshihiro;;;;;2006/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2006/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;;2006/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2006/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;;2006/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;2006/3～

PresentationsOtherCo-authorMURAKAMI,Yoshihiro;;;;2005/9～

PresentationsOtherCo-authorMURAKAMI,Yoshihiro;;;;2005/6～

PresentationsHigh Efficiency in a Bag-packing Algorithm for Achieving Desired Sum Weight by Adding Input Materials -About Limit Weight in Addition-UnrefereedAcademic JournalCo-authorMURAKAMI Yoshihiro;Masashi Kawai;Junichi Kurata;Hironobu Uchiyama;2005/3/19～JSME

PresentationsModeling and Vibration Analysis for Tension Control of Hanging ClothUnrefereedAcademic JournalCo-authorMURAKAMI Yoshihiro;Katsutaka Fujisawa;Junichi Kurata;Hironobu Uchiyama;p.１５１―１５２2005/3/7～SICE

Research reportReducing the number of long-term items: Optimal strategy for a bag-packing problemUnrefereedIn-house publicationCo-authorMURAKAMI Yoshihiro;Junichi Kurata;Hironobu Uchiyama;W.Marquardt;Technology Reports of Kansai University472005/3～

OtherCo-authorMURAKAMI,Yoshihiro;;;;2005/3～

OtherCo-authorMURAKAMI,Yoshihiro;;;;;2005/3～

OtherCo-authorMURAKAMI,Yoshihiro;;;;2005/3～

OtherCo-authorMURAKAMI,Yoshihiro;;;;;;2005/3～

PresentationsIn-house publicationCo-authorMURAKAMI,Yoshihiro;;;;;2005/3～

PresentationsOtherCo-authorMURAKAMI,Yoshihiro;;;;2005/3～

PresentationsAcademic JournalCo-authorMURAKAMI,Yoshihiro;;;;;;;2005/3～

PresentationsIn-house publicationCo-authorMURAKAMI,Yoshihiro;;;;;;;2005/1/18～

PresentationsIn-house publicationCo-authorMURAKAMI,Yoshihiro;;;;2005/1～

PresentationsStudy on Robot Task of Folding Clothes based on RECS ConceptAcademic JournalCo-authorK. Yamato;T. Hara;K. Bando;T. Yamaguchi;Y. Murakami;K. Makihira;M. Takano;S. Aoyagi;Proceedings of International Conference on Machine Automation57‐622004/11～ICMA2004

PresentationsDevelopment of a Welfare Robot based on RECS Concept‐Task of Setting a Meal on the Table‐Academic JournalCo-authorT. Yamaguchi;S. Ohashi;K. Kotani;T. Yamaguchi;Y. Murakami;K. Makihira;M. Takano;S. Aoyagi;Proceedings of International Conference on Machine Automation81‐842004/11～ICMA2004

PresentationsDevelopment of a Micro Tactile Sensor utilizing Piezoresistors and Characterization of its PerformanceAcademic JournalCo-authorJ. Izutani;Y. Maeda;M. Arakawa;K. Kotani;S. Ohashi;T. Yamaguchi;Y. Murakami;T. Hara;K.Makihira;M. Takano;S. Aoyagi;Proceedings of International Conference on Machine Automation193‐1962004/11～ICMA2004

PresentationsMicrofabrication of a Parylene Suspended Structure and Investigation of Its Resonant FrequencyAcademic JournalCo-authorD. Yoshikawa;M. Arakawa;S. Ohashi;K. Kotani;S. Nakahara;T. Yamaguchi;Y. Murakami;M.Takano;K. Makihira;S. Aoyagi;Y. C. Tai;Proceedings of International Conference on Machine Automation207‐2102004/11～ICMA2004

PresentationsFabrication of a Micro Needle made of Biodegradable Polymer MaterialAcademic JournalCo-authorT. Aoki;H. Izumi;M. Fukuda;K. Bando;M. Arakawa;S. Ohashi;K. Kotani;T.Yamaguchi;Y. Murakami;K. Makihira;M. Takano;S. Aoyagi;Proceedings of International Conference on Machine Automation211‐2142004/11～ICMA2004

PresentationsHigh Efficiency in a Bag-packing Algorithm for Achieving Desired Sum Weight by Adding input MaterialsUnrefereedAcademic JournalCo-authorMURAKAMI Yoshihiro;Masashi Kawai;Junichi Kurata;Hironobu Uchiyama;Intelligent Information System;Industial System;Bag-packing;Combinatorial Optimization Problem;2004/3～

PapersEfficient Algorithm for Solving a Bag-packing Problem by Excluding Search SpaceIn refereedAcademic JournalCo-authorMURAKAMI Yoshihiro;Jyunichi Kurata;Hironobu Uchiyama;Keigo Taniya;Masashi Kawai;Large-scale System;Exclusion of Search Space;Bag-packing;Combinatorial Optimization Problem;Transaction of the Japan Society of Mechanical Engineers2003/12～In the bag-packing problem, several items are selected so that the sum weight should be closest to the target weight. In order to obtain an optimal solutions, all the candidate solutions must be enumerated. But when the number of candidate solutions increases, it takes too much time to obtain an optimal solution. So such enumeration method is not efficient. Therefore the following system is developed; such conditions can be derived as would exlude useless, superfluous searches and by checking wheter the conditions are satisfies no not, the number of candidate solutions that must be enumerated can be decreased. Many of the simulation results seem to prove the proposed system to be effective.

PapersRaising the Rate of Feasible Solutions in a Bag-Packing Problem (By Dividing Input Materials into Groups of Lighter Items and Heavier Ones)In refereedAcademic JournalCo-authorMURAKAMI Yoshihiro;Jyunichi Kurata;Hironobu Uchiyama;Masashi Kawai;Optimization;Division of Input Materials;Bag-packing;Constraint Satisfaction Problem;Transactions of the Japan Society of Mechanical Engineers2003/10～In the bag-packing problem, several items are selectecd so that the sum weight should be closest to the target weight. However, in some cases, the sum weight might be far from the target weight. To avoid such an insufficient outcome, the method of dividing the input materials by a certain weight is proposed. Its weight for division is decided so that the number of feasible solutions should be increased. For each of the divided groups, which items to be included in the contents of a bag is determined. Many of the simulation results seem to prove the proposed method to be effective.

PresentationsUnrefereedAcademic JournalCo-authorMURAKAMI Yoshihiro;;;;2003/3～

PresentationsReducing the number of dumping items and efficient algorithm of searching in a bag-packing problemUnrefereedAcademic JournalCo-authorMURAKAMI Yoshihiro;;;;;2002/10～

PapersCharacterization of Infeasible Solutions in a Bag-Packing Problem for Achieving Desired WeightIn refereedAcademic JournalCo-authorMURAKAMI Yoshihiro;Jyunichi Kurata;Hironobu Uchiyama;Takafumi Ueno;coefficient of variation;characterization of infeasible solutions;bag-packing;constraint satisfaction problem;T. SICE2002/9～

PapersReduction of Thermo-Acoustic Self-Sustained Oscillation Noise by Giving Exciting Frequency SignalIn refereedAcademic JournalCo-authorMURAKAMI Yoshihiro;Hironobu Uchiyama;Jyunichi Kurata;Yasuhiro Kajio;beat;Rijke tube;premixed combustion;combustion-driven oscillation;Transactions of the Japan Society of Mechanical Engineering2002/6～A premixed-combustion type boiler has a strong tendency to generate extremely loud combustion noise. In order to use the boiler in practice, it is necessary to minimize such noise. Therefore, in the paper, a noise reduction method is proposed, in which an extra exciting frequency signal may cause the self-sustained frequency intrinsic in the system altered with a synchronization. The boiler system is replaced with a model apparatus which can generate a self-sustained oscillation noise as is often the case in the Rijke tube. In the model apparatus, basic feature of the proposed method and its effectiveness are made clear. By enforcing an exciting frequency signal from outer system, self-sustained frequency can be transferred to a frequency range where system cannot produce oscillation noise. Thus it became evident that the sound level of the total system ban be lowered to a large extent and the proposed method is effective.

PresentationsUnrefereedAcademic JournalCo-authorMURAKAMI Yoshihiro;;;;2002/3～

PresentationsUnrefereedAcademic JournalMURAKAMI Yoshihiro;;;;2002/3～

PresentationsUnrefereedAcademic JournalMURAKAMI Yoshihiro;;2002/3～

PresentationsAlgorithms of Bag-packing Problem for Achieving Desired Weight with a Computerized ScaleUnrefereedAcademic JournalCo-authorMURAKAMI Yoshihiro;;;;2000/8～

PapersSA-Based Scheduling Algorithm for Increasing Probability of Selecting Promising SchedulesIn refereedAcademic JournalCo-authorMURAKAMI Yoshihiro;Mikiya/OKADA;Hironobu/UCHIYAMA;Shinji/HASEBE;Iori/HASHIMOTO;Journal of Chemical Engineering of Japan1999/10～An efficient scheduling algorithm using the Simulated Annealing(SA)method is proposed. In an actual large scheduling problem, the number of schedules searched within a reasonable time is restricted, because calculation of the starting times of jobs requires a long computation time when the problem has various types of constraints. In the proposed algorithm, two types of improvements are proposed to reduce the computation time of a scheduling algorithm: One is to reject, at an early stage of the starting time calculation, those schedules that have little possibility of being accepted in the simulated annealing method. The other is to reject unpromising schedules stochastically using the data related to the production sequence of jobs--not after the calculation of the starting times of jobs but at the step of generating a new production sequence of jobs. Thus, compared with the algorithm which selects a new production sequence randomly, better schedules can be derived in shorter computation time. The developed algorithm has been applied to a practical scheduling problem at a resin production plant, and it has become clear that this algorithm can generate significantly better schedules with a much shorter computation time.

PresentationsCombinatorial Optimization in the Operation of Bag-packing for Achieving Desired WeightUnrefereedAcademic JournalCo-authorMURAKAMI Yoshihiro;;;;1999/10～

PapersScheduling Algorithm Using Repetitive SA Method Allocating Jobs to Desirable Production LinesIn refereedAcademic JournalCo-authorMURAKAMI Yoshihiro;ISHIKURA/Ken'ichi;UCHIYAMA/Hironobu;TANIGUCHI/Satoshi;HASEBE/Shinji;HASHIMOTO/Iori;1999/7～For a process with parallel production lines, a scheduling algorithm possessing the function of allocating each job to a desirable production line is proposed. The proposed algorithm is based on the repeitive simulated annealing(SA)method, in which the scheduling is executed several times for a problem, and the best schedule is selected in the final stage of repetition. In the proposed algorithm, the feature of the repetitive SA method described above is successfully incorporated. First, desirable production lines for treating each job are derived from the scheduling results obtained through several rounds of scheduling. Then, scheduling of the remaining rounds is executed under the condition that the probabilities of allocating a job to desirable production lines are higher than those to the other lines. The proposed algorithm is applied to the scheduling problem of a heat treatment process consisting of nine production lines. The effectiveness of the proposed algorithm is demonstrated through a comparison between scheduling results obtained with the proposed method and those obtained with the conventional repetitive SA method.Kansai University Research Grants 199804-199903

PapersScheduling Algorithm Searching Only the Feasible Production Sequences for Complex Batch Processes with Storage TanksIn refereedAcademic JournalCo-authorMURAKAMI Yoshihiro;OKADA/Mikiya;UCHIYAMA/Hironobu;HASEBE/Shinji;HASHIMOTO/Iori;1998/7～In chemical batch processes, the feasibility of the production sequence of jobs on successive units depends on the number of storage tanks between the units. When some jobs take different production paths between two batch units, it is more difficult to judge whether the production sequence of jobs is feasible or not. In this paper, for the process which has a complicated flow structure and many storage tanks, the condition that the feasible production sequence must satisfy is derived. Then, using the derived condition, a scheduling algorithm based on the simulated annealing method is improved so that the algorithm searches only the feasible production sequences. The improved algorithm has been applied to a practical large scheduling problem, and it has become clearer that plausible schedules can be generated with a shorter computing time.

PresentationsApplication of Repetitive SA Method to Scheduling Problems of Chemical ProcessesIn refereedAcademic JournalCo-authorMURAKAMI Yoshihiro;UCHIYAMA/Hironobu;HASEBE/Shinji;HASHIMOTO/Iori;Computers&Chemical Engineering1997/5～PSE97

PapersApplication of Repetitive SA Method to Scheduling Problems of Chemical ProcessesIn refereedAcademic JournalCo-authorMURAKAMI Yoshihiro;UCHIYAMA/Hironobu;HASEBE/Shinji;HASHIMOTO/Iori;Transactions of the Institute of Systems, Control and Information Engineers1997/3～One of the predominant characteristics of chemical batch processes is that the material leaving a batch unit is fluid. Therefore, the starting times of jobs at each unit must be determined by taking into account the availability of storage between two units. In this paper, for such chemical processes, a scheduling algorithm using simulated annealing(SA)method is proposed. In the proposed method called repetitive SA mathod, in order to reduce the probability of being trapped in a bed local optimum, the scheduling using SA method is executed repeatedly, and a best schedule is selected at the final stage of repetition. The problem is how to determine the number of repetitions of scheduling and the number of schedules searched in a round of scheduling. In order to find out the best combination of those two numbers, first the probability ditributions of the performances of the schedules are calculated for various cases where the number of schedules searched in a round of scheduling is different from one another. Then, the best combination of those numbers is selected using the derived probability distributions.The results of applying the repetitive SA method to scheduling problems of chemical processes suggest that the proposed method is effective typically in reducing the deviation of the performances of the shchedules.

Research reportUnrefereedOtherCo-authorMURAKAMI,Yoshihiro;1997～1999

PapersA Flexible Simulation System for Scheduling with Various ConstraintsIn refereedAcademic JournalCo-authorMURAKAMI Yoshihiro;Shinji/HASEBE;Iori/HASHIMOTO;Journal of Chemical Engineering of Japan1996/4～A simulation system, which can be widely used to determine the starting times of operations for general batch plants, is proposed. The operations of a batch plant are first expressed by a sequence of basic operations such as filling, processing, discharging and cleaing. By using these basic operations, the simulation problem can be reduced to that of determining the starting times of the basic operations. A variety of constraints are grouped into four types, and it is demonstrated that the constraints on finite intermediate storage can be converted into the constraints on precedence relationship of basic operations. Then, for each of the three types of constraints, simulation modules to calculate the earliest and latest starting times of basic operations are developed. A simulation program to calculate the starting times of basic operations which satisfy all types of constraints can be generated by combining these simulation modules.The major feature of the proposed method is that the simulation program can be easily modified by recombining the simulation modules. Therefore, a simulation program with sufficient flexibility can be developed by using the proposed method.