.png){kind=icon}
.png){kind=icon}
Return
Minimizing work overload in mixed-model assembly lines
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2006.08.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A variant of the mixed-model sequencing problem on assembly lines is the one proposed by Yano and Rachamadugu in 1991. They consider time windows in workstations and the work overload concept-sum of differences between real completion time in the workstation and due dates, which depends on the time window value. This paper proposes some procedures for solving the problem, and compares them with others taken from literature using two computational experiments. (c) 2007 Elsevier B.V. All rights reserved.
Keywords:
scheduling
sequencing
just-in-time
work overload
heuristics
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10
Papers:
7.9K
Citations:
3.6W