ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

SMED×Job Shop Scheduling×
분야운영관리운영관리
계열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/ko/compare