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...

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...

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...