Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| SMED× | Programarea atelierului de producție× | |
|---|---|---|
| Domeniu | Managementul operațiunilor | Managementul operațiunilor |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 1985 | 2016 |
| Autorul original≠ | Shigeo Shingo | Pinedo, M. L. |
| Tip≠ | Setup time reduction technique | Combinatorial scheduling problem |
| Sursa seminală≠ | 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 ↗ |
| Denumiri alternative | quick changeover, rapid setup | job scheduling, machine scheduling |
| Înrudite | 5 | 5 |
| Rezumat≠ | 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. |
| ScholarGateSet de date ↗ |
|
|