Results 371 to 380 of about 3,480,656 (399)
Some of the next articles are maybe not open access.
The relationship of schedule flexibility and outcomes via the work‐family interface
, 2010Purpose – The purpose of this paper is to examine the relationship of schedule flexibility with performance and satisfaction in the work and family domains, and whether these associations are mediated by the work‐family interface.
Dawn S. Carlson, J. Grzywacz, K. Kacmar
semanticscholar +1 more source
Insertion scheduling: An alternative to list scheduling for modulo schedulers
1996The list scheduling algorithm is a popular scheduling engine used in most, if not all, industrial instruction schedulers. However this technique has several drawbacks, especially in the context of modulo scheduling. One such problem is the need to restart scheduling from scratch whenever scheduling fails at the current value of the initiation interval.
openaire +2 more sources
2006
Publisher Summary This chapter focuses on the variables that need consideration when making the schedule during production. The shooting, or production, schedule shows the order in which scenes are to be shot during production. Organizing and executing a quick and efficient move of the entire production company, a company move, is an art unto itself ...
Peter W. Rea, David K. Irving
openaire +2 more sources
Publisher Summary This chapter focuses on the variables that need consideration when making the schedule during production. The shooting, or production, schedule shows the order in which scenes are to be shot during production. Organizing and executing a quick and efficient move of the entire production company, a company move, is an art unto itself ...
Peter W. Rea, David K. Irving
openaire +2 more sources
2014
Schedules in the polyhedral model, both those that represent the original execution order and those produced by scheduling algorithms, naturally have the form of a tree. Generic schedule representations proposed in the literature encode this tree structure such that it is only implicitly available.
Verdoolaege, Sven+3 more
openaire +4 more sources
Schedules in the polyhedral model, both those that represent the original execution order and those produced by scheduling algorithms, naturally have the form of a tree. Generic schedule representations proposed in the literature encode this tree structure such that it is only implicitly available.
Verdoolaege, Sven+3 more
openaire +4 more sources
Scientific American, 2015
The article discusses a temperature and pressure study by geologist Michael Manga, as part of the El Jefe project at the University of California, Berkeley, in the February 2015 issue of the "Journal of Volcanology and Geothermal Research" of the eruption cycle and boiling patterns of Yellowstone National Park's Old Faithful geyser in Wyoming.
openaire +3 more sources
The article discusses a temperature and pressure study by geologist Michael Manga, as part of the El Jefe project at the University of California, Berkeley, in the February 2015 issue of the "Journal of Volcanology and Geothermal Research" of the eruption cycle and boiling patterns of Yellowstone National Park's Old Faithful geyser in Wyoming.
openaire +3 more sources
2017
Scheduling problems are notoriously difficult and ILP models have not yet shown adequate strength for them to be competitive with other approaches. This chapter presents a time-indexed model for the Job-Shop problem that can be solved either by column generation or by a compact equivalent formulation.
Lancia G., Serafini P.
openaire +1 more source
Scheduling problems are notoriously difficult and ILP models have not yet shown adequate strength for them to be competitive with other approaches. This chapter presents a time-indexed model for the Job-Shop problem that can be solved either by column generation or by a compact equivalent formulation.
Lancia G., Serafini P.
openaire +1 more source
2016
In this chapter, scheduling and routing principles are discussed. At the beginning, a typical case for operative decision making and mathematical graphs for the representation of decision situations in a network structure are introduced. Additionally, the first insights into the algorithmic processing of graph-data as the basic ingredient for decision ...
Jörn Schönberger+2 more
openaire +2 more sources
In this chapter, scheduling and routing principles are discussed. At the beginning, a typical case for operative decision making and mathematical graphs for the representation of decision situations in a network structure are introduced. Additionally, the first insights into the algorithmic processing of graph-data as the basic ingredient for decision ...
Jörn Schönberger+2 more
openaire +2 more sources