Sciweavers

720 search results - page 16 / 144
» Machine scheduling with resource dependent processing times
Sort
View
COR
2006
86views more  COR 2006»
14 years 11 months ago
Minimizing the earliness-tardiness costs on a single machine
In this paper the one-machine scheduling problem with linear earliness and tardiness costs is considered. The7 cost functions are job dependent and asymmetric. The problem consist...
Jakub Bauman, Joanna Józefowska
MICRO
1999
IEEE
110views Hardware» more  MICRO 1999»
15 years 4 months ago
Balance Scheduling: Weighting Branch Tradeoffs in Superblocks
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
Alexandre E. Eichenberger, Waleed Meleis
JSSPP
2000
Springer
15 years 3 months ago
Time-Sharing Parallel Jobs in the Presence of Multiple Resource Requirements
Abstract. Buffered coscheduling is a new methodology that can substantially increase resource utilization, improve response time, and simplify the development of the run-time suppo...
Fabrizio Petrini, Wu-chun Feng
RTSS
2006
IEEE
15 years 5 months ago
Diverse Soft Real-Time Processing in an Integrated System
The simple notion of soft real-time processing has fractured into a spectrum of diverse soft real-time types with a variety of different resource and time constraints. Schedulers ...
Caixue Lin, Tim Kaldewey, Anna Povzner, Scott A. B...
EOR
2006
107views more  EOR 2006»
14 years 11 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...