نتایج جستجو برای: jit scheduling

تعداد نتایج: 69548  

Journal: :Journal of Industrial Engineering International 2016

Journal: :TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C 1996

2002
Tatiana Shpeisman Guei-Yuan Lueh Ali-Reza Adl-Tabatabai

This paper describes a just-in-time (JIT) Java1 compiler for the Intel Itanium processor. The Itanium processor is an example of an Explicitly Parallel Instruction Computing (EPIC) architecture and thus relies on aggressive and expensive compiler optimizations for performance. Static compilers for Itanium use aggressive global scheduling algorithms to extract instruction-level parallelism. In a...

Journal: :European Journal of Operational Research 2011
Nils Boysen Stefan Bock

With increasing cost competition and product variety, providing an efficient Just-inTime (JIT) supply has become one of the greatest challenges in the use of mixedmodel assembly line production systems. In the present paper, therefore, we propose a new approach for scheduling JIT part supply from a central storage center. Usually, materials are stored in boxes that are allotted to the consumpti...

2002
Bahrom Sanugi Shaharuddin Salleh

The parallel machine, distinct due date, early/tardy machine problem closely models the situation faced by ‘Just-In-Time’ (JIT) manufacturers. This paper develops a new method of finding good quality solutions to this scheduling problem by using the neural network. A model for training neural network to sequencing the jobs has been developed based on the vector representation of the early/tardy...

Journal: :Transactions of the Institute of Systems, Control and Information Engineers 2000

Journal: :TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C 1998

Journal: :Computers & OR 2005
Refael Hassin Mati Shani

The study of scheduling problems with earliness–tardiness (E/T) penalties is motivated by the just-in-time (JIT) philosophy, which supports the notion that earliness, as well as tardiness, should be discouraged. In this work, we consider several scheduling problems. We begin by generalizing a known polynomial time algorithm that calculates an optimal schedule for a given sequence of tasks, on a...

Journal: :Transactions of the Institute of Systems, Control and Information Engineers 2001

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید