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/zh/compare