Search Results 1-20 of 160

  • Improved Parallel Reactive Hybrid Particle Swarm Optimization using Improved Neighborhood Schedule Generation Method for the Integrated Framework of Optimal Production Scheduling and Operational Planning of an Energy Plant in a Factory  [in Japanese]

    Kawaguchi Shuhei , Fukuyama Yoshikazu

    … <p>This study proposes improved parallel reactive hybrid particle swarm optimization (IPRHPSO) using an improved neighborhood schedule generation method for the integrated framework of optimal production scheduling and operational planning of an energy plant in a factory. …

    IEEJ Transactions on Industry Applications 139(12), 1005-1014, 2019

    J-STAGE 

  • MODELING AND SOLVING OPEN SHOP COOPERATIVE TASK SCHEDULING PROBLEMS BASED ON SATISFIABILITY MODULO THEORIES

    Kakiuchi Yosuke , Kato Kosuke , Katagiri Hideki

    … In the manufacturing process, it is necessary to schedule the processingorder of machines in order to improve productivity. … The scheduling can be modeled asan open shop scheduling problem. … However, it has a constraint that multiple machinescannot process the same job at the same time, and is not suitable for cooperativeworks, such as software development or service engineering. …

    Scientiae Mathematicae Japonicae 81(2), 183-193, 2018

    J-STAGE 

  • An approach to cooking process scheduling for a family restaurant

    KIMURA Yuki , SHIGENO Maiko , SHIMIZU Kengo , TSUBOI Tetsuya , HASEGAWA Daisuke , ISHIKAWA Kouji , KIMURA Keisuke , TANAKA Miku , OZEKI Kazunori , ZHOU Jieying

    … This scheduling problem can be regarded as a kind of job shop scheduling. … Thus, we use dispatching rules that evaluate the priorities of all jobs not yet executed and that select one job to start next. … We next propose three scheduling methods, taking account of slightly prospective situations in order to make a preferred schedule in which multiple dishes are served at the same time for the same table. …

    Journal of Advanced Mechanical Design, Systems, and Manufacturing 12(3), JAMDSM0076-JAMDSM0076, 2018

    J-STAGE 

  • Job Shop Scheduling through Tabu Search Algorithm with Partial Non-delay Schedule Generation Process  [in Japanese]

    椎原 正次

    日本経営システム学会誌 34(1), 9-19, 2017-07

  • Job Shop Scheduling Based on Partial Non-delay Schedule Generation through Tabu Search Algorithm  [in Japanese]

    椎原 正次

    日本経営システム学会全国大会講演論文集 56, 38-41, 2016-06-04

  • 213 A Scheduling Method Considering Job Exchange between Manufacturing Cells in Hierarchical and Decentralized Manufacturing Systems  [in Japanese]

    Sakaguchi Tatsuhiko , Suzuki Yuma , Shimizu Yoshiaki , Uchiyama Naoki

    … To generate a suitable schedule for such systems, in this study, we propose a distributed and decentralized scheduling method by exchanging jobs between manufacturing cells. …

    Manufacturing Systems Division Conference 2016, 79-80, 2016-03-11

  • 207 An Efficient Search Method for Active Schedule  [in Japanese]

    Eguchi Toru , Iio Takaaki , Murayama Takeshi

    … This paper proposes an efficient optimization method for job shop scheduling. … In the proposed method, the job which arrives a machine earlier is set to have a higher priority value using a weight value to avoid making the machine idle long time. …

    Manufacturing Systems Division Conference 2016, 67-68, 2016-03-11

  • A Scheduling Method Considering Job Exchange between Manufacturing Cells in Hierarchical and Decentralized Manufacturing Systems  [in Japanese]

    Sakaguchi Tatsuhiko , Suzuki Yuma , Shimizu Yoshiaki , Uchiyama Naoki

    … To generate a suitable schedule for such systems, in this study, we propose a distributed and decentralized scheduling method by exchanging jobs between manufacturing cells. …

    The Proceedings of Manufacturing Systems Division Conference 2016(0), 213, 2016

    J-STAGE 

  • An Efficient Search Method for Active Schedule  [in Japanese]

    Eguchi Toru , Iio Takaaki , Murayama Takeshi

    … <p>This paper proposes an efficient optimization method for job shop scheduling. … In the proposed method, the job which arrives a machine earlier is set to have a higher priority value using a weight value to avoid making the machine idle long time. …

    The Proceedings of Manufacturing Systems Division Conference 2016(0), 207, 2016

    J-STAGE 

  • Modification of a Process Schedule with Partial Rearrangement  [in Japanese]

    SANTO Yuki , TAKATA Masayuki

    … <p>Job shop scheduling problem is one of the most diffficult problem to find the optimum solution. … Many metaheuristic approaches were proposed to deel with combinatorial explosion problem of job shop scheduling. … In this research, we propose a method for modification of a process schedule with partial rearrangement as specialized method for scheduling problems. …

    The Proceedings of Mechanical Engineering Congress, Japan 2016(0), S1420202, 2016

    J-STAGE 

  • Optimization problem for feasibility evaluation of schedules considering blocking

    HAYASAKA Takehiro , HINO Rei

    … In the present paper, the job shop scheduling problem with no intermediate buffers, i.e. the blocking job shop scheduling problem, is investigated. … Under the condition where blocking is considered, complicated calculations must be performed to evaluate semi-active schedules when a partial change of a schedule, or exchange of an operation order of jobs on a specific machine, is planned. …

    Journal of Advanced Mechanical Design, Systems, and Manufacturing 10(2), JAMDSM0016-JAMDSM0016, 2016

    J-STAGE 

  • Job Shop Scheduling through Tabu Search Algorithm with Partial Non-delay Schedule Generation  [in Japanese]

    椎原 正次

    日本経営システム学会全国大会講演論文集 55, 196-199, 2015-09-02

  • Job Shop Scheduling Based on Partial Non-delay Schedule Generation through Genetic Algorithm  [in Japanese]

    椎原 正次 , 水谷 泰治

    日本経営システム学会誌 32(1), 1-11, 2015-07

  • Optimal Scheduling of a Thorough Physical Medical Checkup:- Systematic Construction of SSSMC -  [in Japanese]

    ITO Mari , SUZUKI Atsuo , KAWAHARA Yoshiaki

    人間ドックの検査間の待ち時間を短くするために,対話型のスケジューリング支援システムを試作した.本論文では,システムの設計の考え方,人間ドック・スケジューリングの0-1整数計画問題としての定式化,実際例への適用結果を報告する.さらに,受診者の検診の開始順序を決定する問題をジョブショップ・スケジューリング問題の変種として捉えることで,受診者の順序にSPT規則を適用し,受診者の検診を開始する順序を並びか …

    Journal of Japan Industrial Management Association 66(1), 49-58, 2015

    J-STAGE 

  • Robust Scheduling for Flexible Job-Shop Problems with Uncertain Processing Times

    Li Wan-Ling , Murata Tomohiro , Fauadi Muhammad Hafidz Fazli bin Md

    … Effectiveness of the proposed technique is evaluated through a case study of Flexible Job-Shop scheduling problem (FJSP) with uncertain job processing time. … A bi-objective evaluation measure of robust schedule is defined as minimizing the expected makespan under possible scenarios and also minimizing variability of it. …

    IEEJ Transactions on Electronics, Information and Systems 135(6), 713-720, 2015

    J-STAGE 

  • 2A1-M02 Solution of Job-shop Scheduling Problem by the Immune Algorithm  [in Japanese]

    SHIMAKURA Wataru , WATANABE Michiko , SUZUKI Ikuo , IWADATE Kenji

    … The Job-shop Scheduling Problem is a classical, but yet modern problem. … The optimal schedule becomes very important from a viewpoint of cost reduction in the manufacturing industry. … This study optimizes the job-shop scheduling with multiple purpose functions by using evolutional computation. …

    The Proceedings of JSME annual Conference on Robotics and Mechatronics (Robomec) 2015(0), _2A1-M02_1-_2A1-M02_3, 2015

    J-STAGE 

  • 1909 Active Schedule Generation Algorithm that Makes Decisions According to Time Progress

    EGUCHI Toru , HOSHINO Naoshi , KISHIMOTO Tetsuya , IIO Takaaki , MURAYAMA Takeshi

    … This paper deals with the optimization of job shop scheduling. … The optimal schedule for minimizing a regular objective function such as tardiness of jobs exists in the set of active schedules. … algorithm can generate active schedules for job shop scheduling. …

    Proceedings of International Conference on Leading Edge Manufacturing in 21st century : LEM21 2015.8(0), _1909-1_-_1909-4_, 2015

    J-STAGE 

  • Flexible job shop scheduling with weighted tardiness and setup worker load balance in make-to-order manufacturing  [in Japanese]

    MORINAGA YASUHIKO , NAGAO MASAHIRO , SANO MITSURU

    本論では,多品種の製品の受注生産している中小企業におけるフレキシブルジョブショップスケジューリング問題(FJSP)の最適化について述べる.問題の目的関数には重み付けした納期遅れと段取り者の負荷の平準化を組み入れ,最適化手法としては島モデルを組み入れたGenetic Algorithm(GA)を開発し,実在する受注生産型の中小企業の生産データを用いて研究を行った.開発したGAの解と納期のみを優先させ …

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 114(105), 143-149, 2014-06-25

  • Flexible job shop scheduling with weighted tardiness and setup worker load balance in make-to-order manufacturing  [in Japanese]

    MORINAGA YASUHIKO , NAGAO MASAHIRO , SANO MITSURU

    本論では,多品種の製品の受注生産している中小企業におけるフレキシブルジョブショップスケジューリング問題(FJSP)の最適化について述べる.問題の目的関数には重み付けした納期遅れと段取り者の負荷の平準化を組み入れ,最適化手法としては島モデルを組み入れたGenetic Algorithm(GA)を開発し,実在する受注生産型の中小企業の生産データを用いて研究を行った.開発したGAの解と納期のみを優先させ …

    IEICE technical report. Neurocomputing 114(104), 143-149, 2014-06-25

  • Flexible job shop scheduling with weighted tardiness and setup worker load balance in make-to-order manufacturing  [in Japanese]

    Yasuhiko Morinaga , Masahiro Nagao , Mitsuru Sano

    本論では,多品種の製品の受注生産している中小企業におけるフレキシブルジョブショップスケジューリング問題 (FJSP) の最適化について述べる.問題の目的関数には重み付けした納期遅れと段取り者の負荷の平準化を組み入れ,最適化手法としては島モデルを組み入れた Genetic Algorithm(GA) を開発し,実在する受注生産型の中小企業の生産データを用いて研究を行った.開発した GA の解と納期の …

    IPSJ SIG Notes 2014-MPS-98(24), 1-7, 2014-06-18

Page Top