Nowadays, manufacturing enterprises face the challenge of just-in-time (JIT) production and energy saving. Therefore, study of JIT production and energy consumption is necessary and important in manufacturing sectors. Moreover, energy saving can be attained by the operational method and turn off/on idle machine method, which also increases the complexity of problem solving. Thus, most researche...

This paper addresses the integrated scheduling and lot-sizing problem in a manufacturing environment which produces complex assemblies. Given the due-dates of the end items, the objective is to minimize the cumulative lead time of the production schedule (total makespan) and reduce set-up and inventory holding costs. A JIT production strategy is adopted in which production is scheduled as late ...

We present the design and implementation of several optimizations and techniques included in the latest IBM Java Just-in-Time (JIT) Compiler. We first discuss some of the modifications we have applied to Sun Microsystems’ reference implementation of the Java Virtual Machine (JVM) Specification to increase the performance, including a change in the object layout. We then describe each of the opt...

Just-in-Time (JIT) compilers for Java can be augmented by making use of runtime profile information to produce better quality code and hence achieve higher performance. In a JIT compilation environment, the profile information obtained can be readily exploited in the same run to aid recompilation and optimization of frequently executed (hot) methods. This paper discusses a low overhead path pro...

This paper addresses the problem of how a group of agents cooperating on a complex plan with interdependent actions can coordinate their scheduling and execution of those actions, particularly in domains where actions may fail or have uncertain durations. If actions fail (or fail to meet their deadlines), the repercussions for the rest of the team’s plan can be dramatic. This paper presents a p...

Tracing JIT compilation generates units of compilation that are easy to analyse and are known to execute frequently. The AJITPar project aims to investigate whether the information in JIT traces can be used to make better scheduling decisions or perform code transformations to adapt the code for a specific parallel architecture. To achieve this goal, a cost model must be developed to estimate t...

This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, mult...

This paper addresses the combined JIT scheduling and tool replacement problem on a machining centre. The objective is to determine job sequence, tool spare requirement and corresponding replacement intervals so that the total expected processing cost is minimized. Due to the combinatorial nature of the problem, a tabu search approach is proposed to find good and quick solutions. An example prob...

This paper investigates three scheduling algorithms and three inventory control policies to evaluate their effect on the system performance measures using computer simulation. The model chosen is a flow-shop type, computer assembly plant. Analysis is conducted on two scheduling measures (summation of process time and tardiness) and two inventory control measures (ordering cost and holding cost)...