Showing 1 - 10 of 16
Persistent link: https://www.econbiz.de/10005508358
Lot streaming is the process of splitting a production lot into sublots, and then, scheduling the sublots in an overlapping fashion on the machines. In this paper, we present a polynomial-time procedure for determining the number of sublots of a single-lot, multiple-machine flow shop...
Persistent link: https://www.econbiz.de/10005414162
Persistent link: https://www.econbiz.de/10005417984
The random nature of soil loss under alternative land-use practices should be an important consideration of soil conservation planning and analysis under risk. Chance constrained programming models can provide information on the trade-offs among pre-determined tolerance levels of soil loss,...
Persistent link: https://www.econbiz.de/10005468722
Persistent link: https://www.econbiz.de/10005095240
The inter-departure time variability is an important measure in production lines. Higher variability means added work-in-process and less predictability in output. It can be a primary obstacle towards achieving on-time delivery. The effects of line parameters (e.g., line length or buffer...
Persistent link: https://www.econbiz.de/10005066856
In this paper, we consider the lot-streaming problem of sequencing a set of batches, to be processed in equal sublots, in a flow-shop, so as to minimize makespan. A new heuristic procedure, called the bottleneck minimal idleness heuristic, is developed. Results of an experimental study are...
Persistent link: https://www.econbiz.de/10005334001
In this paper, a methodology is developed to solve the single-model, stochastic assembly line balancing problem for the objective of minimizing the total labor cost and the expected incompletion cost arising from tasks not completed within the prescribed cycle time. The methodology is based on...
Persistent link: https://www.econbiz.de/10005336163
In this paper, we address an n-job, m-machine permutation flow shop scheduling problem for the objective of minimizing the total flow time. We propose a modification of the best-known method of Framinan and Leisten [An efficient constructive heuristic for flowtime minimization in permutation...
Persistent link: https://www.econbiz.de/10005336314
Persistent link: https://www.econbiz.de/10005339527