ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

Plánování zakázkové výroby×Model SCOR×
OborProvozní managementProvozní management
RodinaMachine learningMachine learning
Rok vzniku20161996
TvůrcePinedo, M. L.Pittiglio, Rabin, Todd & McGrath
TypCombinatorial scheduling problemSupply chain reference framework
Původní zdrojPinedo, M. L. (2016). Scheduling: Theory, algorithms, and systems (5th ed.). Cham: Springer. DOI ↗Stewart, G. (1997). Supply chain operations reference model: SCOR, logistics information management, Vol. 10 No. 5, pp. 62-74. link ↗
Další názvyjob scheduling, machine scheduling
Příbuzné55
Shrnutí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.The Supply Chain Operations Reference Model is a standardized framework for supply chain management developed by the Supply Chain Council (now APICS) in 1996. SCOR provides a structured approach to identify, evaluate, and improve supply chain processes across organizations, regardless of industry. It integrates planning, sourcing, manufacturing, delivery, and returns into a coherent operational model.
ScholarGateDatová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: Job Shop Scheduling · SCOR Model. Získáno 2026-06-18 z https://scholargate.app/cs/compare