نتایج جستجو برای: jit scheduling
تعداد نتایج: 69548 فیلتر نتایج به سال:
Scheduling problems involving both earliness and tardiness costs have received significant attention in recent years. This type of problem became important with the advent of the justin-time (JIT) concept, where early or tardy deliveries are highly discouraged. In this work we examine the flowshop scheduling problem with no storage constraints and with blocking inprocess. In this latter environ...
A distributed JVM on a cluster can provide a highperformance platform for running multi-threaded Java applications transparently. Efficient scheduling of Java threads among cluster nodes in a distributed JVM is desired for maintaining a balanced system workload so that the application can achieve maximum speedup. We present a transparent thread migration system that is able to support high-perf...
This paper presents the optimal scheduling in a single machine by considering idle insert. The objective function is to minimize the sum of maximum earliness and tardiness. This scheduling problem can be applied in different production systems such as just in time (JIT) systems. Special case of common due date is presented and the associated optimal solution is reported. In general case of a si...
‘Survival of the fittest’ is the reality in modern global competition. Organizations around the globe are adopting or willing to embrace just-in-time (JIT) production to reinforce the competitiveness. Even though JIT is the most powerful inventory management methodologies it is not free from barriers. Barriers derail the implementation of JIT production system. One of the most significant tasks...
The Java Bytecode language lacks expressiveness for traditional compiler optimizations, making this portable, secure software distribution format ineecient as a program representation for high performance. This inee-ciency results from the underlying stack model, as well as the fact that many bytecode operations intrinsically include sub-operations (e.g., iaload includes the address computation...
A two-machine permutation flow shop scheduling with n independent jobs and different due dates is considered in this paper. Since this problem is shown to be NP-Hard, We use the simulated annealing to solve this problem. The objective is minimizing the weighted earliness and tardiness that cover JIT concept. We construct our algorithm in four scenarios with considering two Markov chains and two...
Research on the automated control of a flexible manufacturing workcell has generally assumed that there is a low-level computer system to control the machines, without addressing the precise functionality of this low-level system and how it might uniquely support the manufacture of products. This work addresses how Spring, a real-time operating system, can be used to implement a Just-In-Time (J...
This study constructs multi-item scales to measure key components of JIT production and manufacturing strategy and examines the relationship between them, and the impact of manufacturing strategy on JIT performance for machinery, electrical & electronics and automobile industries in Japan, USA, and Italy. JIT production scales include JIT schedule, JIT layout, JIT delivery by suppliers, JIT lin...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید