ScholarGate
Βοηθός

Σύγκριση μεθόδων

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

Προγραμματισμός Εργασιών σε Εργαστήριο (Job Shop Scheduling)×Μοντέλο SCOR×
ΠεδίοΔιοίκηση ΛειτουργιώνΔιοίκηση Λειτουργιών
ΟικογένειαMachine learningMachine learning
Έτος προέλευσης20161996
ΔημιουργόςPinedo, M. L.Pittiglio, Rabin, Todd & McGrath
ΤύποςCombinatorial scheduling problemSupply chain reference framework
Θεμελιώδης πηγήPinedo, 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 ↗
Εναλλακτικές ονομασίεςjob scheduling, machine scheduling
Συναφείς55
Σύνοψη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.
ScholarGateΣύνολο δεδομένων
  1. v1
  2. 2 Πηγές
  3. PUBLISHED
  1. v1
  2. 2 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Λήψη διαφανειών

ScholarGateΣύγκριση μεθόδων: Job Shop Scheduling · SCOR Model. Ανακτήθηκε στις 2026-06-19 από https://scholargate.app/el/compare