ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

SMED×ジョブショップスケジューリング×
分野オペレーションズ・マネジメントオペレーションズ・マネジメント
系統Machine learningMachine learning
提唱年19852016
提唱者Shigeo ShingoPinedo, M. L.
種類Setup time reduction techniqueCombinatorial scheduling problem
原典Shingo, S. (1985). A revolution in manufacturing: The SMED system. Cambridge, MA: Productivity Press. link ↗Pinedo, M. L. (2016). Scheduling: Theory, algorithms, and systems (5th ed.). Cham: Springer. DOI ↗
別名quick changeover, rapid setupjob scheduling, machine scheduling
関連55
概要Single Minute Exchange of Die (SMED) is a systematic approach developed by Shigeo Shingo in the 1980s to drastically reduce the time required to changeover equipment from producing one product to another. The methodology, part of the Toyota Production System, aims to reduce setup time to a single-digit minute range (ideally under nine minutes), enabling smaller batch sizes, faster response to customer demand, and improved flexibility in manufacturing. SMED is a cornerstone of lean manufacturing and just-in-time production.Job shop scheduling is the problem of assigning a set of jobs (tasks) to a set of machines (resources) over time, subject to precedence and capacity constraints, with the goal of optimizing performance metrics such as makespan (total completion time), lateness, or cost. The job shop problem is a classic combinatorial optimization problem in operations research, addressed through heuristics (greedy dispatching rules, simulated annealing, genetic algorithms) and exact algorithms (branch-and-bound, constraint programming). It is fundamental to manufacturing, project management, and computational scheduling.
ScholarGateデータセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 2 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: SMED · Job Shop Scheduling. 2026-06-19に以下より取得 https://scholargate.app/ja/compare