विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| जॉब शॉप शेड्यूलिंग× | SCOR मॉडल× | |
|---|---|---|
| क्षेत्र | संचालन प्रबंधन | संचालन प्रबंधन |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 2016 | 1996 |
| प्रवर्तक≠ | Pinedo, M. L. | Pittiglio, Rabin, Todd & McGrath |
| प्रकार≠ | Combinatorial scheduling problem | Supply 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 | — |
| संबंधित | 5 | 5 |
| सारांश≠ | 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डेटासेट ↗ |
|
|