flow shop sequencing problem is included in np-hard problems and a number of heuristic methods have been developed to solve it. most of these methods are offered for the crisp processing time. however fuzzy algorithm is appropriate for the problems with fuzzy processing time. this paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

This paper deals with multi-operation models, which are different from the flow shop and job shop models. In the flow shop or job shop models, the routes of all jobs are known in advance. In practice, the route of the job is often immaterial and up to the scheduler to decide. When the routes of the jobs are open, the model is referred to as an open shop. This paper describes the development of ...

The proposed hybrid stage shop scheduling (HSSS) model, inspired from a real case in the high-fashion industry, aims to fully exploit the potential of parallel resources, splitting and overlapping concurrent operations among teams of multifunctional machines and operators on the same job. The HSSS formally extends mixed shop scheduling (a combination of flowshop and open shop), which is able to...

One-opeator two-machine open shop and ow shop problems are NP-hard in the ordinary sense even if all the weights are the same. We discuss two di erent pseudo polynomial dynamic programming recursions for each of the open shop and ow shop case. Some of the running times are better than those of the best known algorithms in the literature.

Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times a...

The flexibility present in a job shop is an important determinant of the future success of the shop, since it increases the ability to deal with the changes a job shop is faced with in a dynamic environment. The presence of idle-time in a job shop schedule contributes considerably to this flexibility. By introducing an anticipation factor that preserves idletime in the scheduling process more f...

We develop a search-theoretic model of the product market that generates price dispersion across and within stores. Buyers differ with respect to their ability to shop around, both at different stores and at different times. The fact that some buyers can shop from only one seller while others can shop from multiple sellers causes price dispersion across stores. The fact that the buyers who can ...

摘要 現場管制系統是ERP的主要子系統之一, 其主要功能是安排現場訂單的排程. 根據研 究,大部分現場的排程問題是屬於 Job Shop問 題. 所以過去幾十年來 Job Shop問題一直是 產業界與學術界重要的研究課題之一. 其間 雖有無數的論文發表, 但因缺少考慮現場實際 的狀況, 很少研究的成果可以用來解決現場的 排程問題. 本研究開發以 Tabu Search為主的 排程方法. 經以個人在美國工作現場所使用之 MRP II 系統所產生的資料驗證, 本方法確能 有效求解現場的排程問題. 關鍵字: Job Shop, Tabu Search Abstract Shop floor control system is a sub-system of the ERP system. Its major function is to generate daily schedules f...

We develop a search-theoretic model of the product market that generates price dispersion across and within stores. Buyers differ with respect to their ability to shop around, both at different stores and at different times. The fact that some buyers can shop from only one seller while others can shop from multiple sellers causes price dispersion across stores. The fact that the buyers who can ...

This paper provides a simulation model to study the effect of the work-in-process control on due date performance in job shop environment. The due date performance is measured by both the number of tardy jobs and the total tardiness. The simulation runs include different shop configurations (flow shop and general job shop), workloads and sequencing rules. As expected, the results reveal that du...