The assumption of classical shop scheduling problems that each job visits each machine only once (Baker, 1974) is often violated in practice. A new type of manufacturing shop, the reentrant shop has recently attracted attention. The basic characteristic of a re-entrant shop is that a job visits certain machines more than once. For example, in semiconductor manufacturing, consequently, each wafe...

Fine-grained accelerators have the potential to deliver significant benefits in various platforms for embedded signal processing. Due to the moderate complexity of their targeted operations, these accelerators must be managed with minimal run-time overhead. In this paper, we present a methodology for applying flow-shop scheduling techniques to make effective, lowoverhead use of fine-grained DSP...

This paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the total work-in-process inventory. Job scheduling problems are one of the oldest and real world combinational optimization problems. It is multi objective and complex in nature. There exist some criteria that must be taken into consideration when evaluating the quality of the proposed schedule. Consideration of jo...

although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

This paper provides a heuristic procedure for solving the constrained flow-shop scheduling problems of n-jobs on m-machines. We obtained a schedule with a set of n-jobs to minimize the mean weighted flow-time. This method is very easy to understand and to apply. It will also help managers in the scheduling related issues by aiding them in the decision making process and providing an optimal or ...

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

XII

We investigate the stochastic flow shop problem with m machines and general distributions for processing times. No analytic method exists for solving this problem, so we looked instead at heuristic methods. We devised three constructive procedures with modest computational requirements, each based on approaches that have been successful at solving the deterministic counterpart. We compared the ...