方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 装配线平衡× | 作业车间调度× | |
|---|---|---|
| 领域 | 运营管理 | 运营管理 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2010 | 2016 |
| 提出者≠ | Scholl, A. | Pinedo, M. L. |
| 类型≠ | Optimization problem | Combinatorial scheduling problem |
| 开创性文献≠ | Scholl, A. (2010). Balancing and sequencing of assembly lines. Physica-Verlag. link ↗ | Pinedo, M. L. (2016). Scheduling: Theory, algorithms, and systems (5th ed.). Cham: Springer. DOI ↗ |
| 别名 | line balancing, workload balancing | job scheduling, machine scheduling |
| 相关 | 5 | 5 |
| 摘要≠ | Assembly Line Balancing is the problem of distributing a sequence of assembly tasks across a series of workstations on a production line such that work is evenly distributed, idle time is minimized, and throughput constraints are satisfied. The goal is to assign tasks to stations such that the total work time at each station is as equal as possible, optimizing for production rate (cycle time) and resource utilization. This is a classic optimization problem in manufacturing, solved through heuristic and exact algorithms, essential to the efficiency of mass production systems. | 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数据集 ↗ |
|
|