Multi-Job Cyclic Scheduling for an Automated Job-Shop-Type Manufacturing System : Relationship Between Job Output Interval and Buffer Capacity
スポンサーリンク
概要
- 論文の詳細を見る
A multi-job cyclic scheduling problem for an automated job-shop-type manufacturing system was analyzed. In the cyclic scheduling problem, an optimum schedule is a non-idle schedule, where a bottleneck machine produces jobs without idle time in the steady state. A dividing method of the jobs was introduced and the job output interval in the steady state was clarified. A lower bound on the buffer capacity was obtained to construct a non-idle schedule.
- 一般社団法人日本機械学会の論文
- 1989-09-15
著者
-
Yura Kenji
Department of Systems Engineering University of Electro-Communications
-
Yura K
Univ. Electro‐communications Tokyo Jpn
関連論文
- 5A3 ONLINE SCHEDULING FOR FLEXIBLE FLOW SHOPS WITH DUE DATE CONSTRAINT(Technical session 5A : Sophisticated scheduling 2)
- 4B3 INTERACTIVE MULTI-SHIFT SCHEDULING TO SATISFY WORKER'S PREFERENCE ON SHIFT AND DAYS-OFF(Technical session 4B : Personnel scheduling)
- Interactive Multi-Shift Scheduling to Satisfy Worker's Preferences on Shift and Days-off(Advanced Production Scheduling)
- Online Scheduling Aiming to Satisfy Due Date for Flexible Flow Shops(Advanced Production Scheduling)
- Multi-Job Cyclic Scheduling for an Automated Job-Shop-Type Manufacturing System : Relationship Between Job Output Interval and Buffer Capacity