When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance. A well known example for such a case that this paper specifically deals with is the turning operation on a CNC machine. Manufacturing cost of a turning operation is a nonlinear convex function of its processing time. In this paper, we deal with making ...

Job scheduling has always been a challenging task in modern manufacturing and the most real life scheduling problems which involves multi-criteria and multi-machine environments. In this research our direction is largely motivated by the adoption of the Just-In-Time (JIT) philosophy in parallel machines system, where processing times of jobs are controllable. The goal of this paper is to minimi...

 Background and Objectives:Rapid processing of histopathological specimens and decreased turnaround time is important to fulfill the needs of clinicians treating sick patients, so the present study was conducted to compare the time taken and quality of sections in processing of prostatic tissue by rapid microwave and conventional techniques using morphometry. Methods: Four to five mm thick p...

This paper considers a genetic algorithm (GA) for a machine-job assignment with controllable processing times (MJACPT). Integer representation with standard genetic operators is used. In an objective function, a job assignment is obtained from genetic code and for this, fixed assignment processing times are calculated by solving a constrained nonlinear convex optimization problem. Additionally,...

A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a nonlinear relationship between the manufacturing cost and its required processing time on a CNC turning machine. If we consider total manufacturing cost (F1) and total weighted completion time (F2) objectives simultaneo...

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

According to the increased fungi contaminations and related damages, microbiologist's incentive in considering the fungal contaminations in human habitats had increased. Some of fungi cause disease through production of toxins in animals as well as humans. Since these toxins are not easily distinguishable, then it is crucial to study their characteristics. Aspergillus are among the most importa...

The resource requirements and processing characteristics of parallel scientiic applications are quite diverse. In this paper, we present a new resource management approach for scheduling such parallel applications that combines multiple scheduling paradigms with a fault-tolerance paradigm into a coherent system. Results from a prototype implementation demonstrate that our system provides signii...

We outline the design of a scientiic visualization system based on a data card display invariant to provide information on the creation and processing of tasks in distributed task pool algorithms. Information aggregates over the tasks and processes are incorporated via non-classical histogram representations showing the distribution of the data within individual bins and by user-controllable tr...