The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
[Tanko, Jozsef] Dominant schedules of a steady job-flow pair. Acta Cybernet. 5 (1980), no. 1, 87-115. ... Author’s summary: “A specific approach to some nonfinite de- terministic scheduling problems is the scheduling of a steady job- flow pair model. ...
In the third chapter we define the concept of the steady job-flow pair, the accruing concepts of scheduling steady job-flow pairs and classify the feasible schedules and the scheduling strategies. ... ., ute) Author’s summary: “This article deals with the special nonfinite deterministic scheduling problem of steady job-flow pairs. ...
395 90C Mathematical programming scheduling of steady job-flow pairs”, Found. ... Control Engrg, to appear; “Reduction method for nonpreemptive scheduling steady job-flow pairs”, ibid., to appear] as a nonfinite deterministic model of servicing invariably renewing demand series. ...
Unemployment--job seeking--is one of the inputs to organization. The flow of organizational effort represented by unemployment is analogous to the flow of physical investment. ... When an adverse technology shock causes job destruction, the economy substitutes the formation of new organizational capital for the flow of output. ... As I will show, there is an exact analogy in steady states between a model with a flow of reorganizational investment and one with a flow of investment in physical capital. ...doi:10.1016/s0167-2231(00)00014-2 fatcat:wfhy4qnpfvguvkq7z5k7myb27u
[Tanko, Jozsef} Nonpreemptive scheduling of a steady job-flow pair. Found. Control Engrg. 6 (1981), no. 3, 173-190 (1982). ... Two regularly renewing demands modelled by a steady job-flow pair must be serviced by one processor with maximal utilization and without preemption. ...
This paper presents a new multi-objective job shop scheduling with sequence-dependent setup times. ... The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. ...  to find nondominated solution sets for the JSSP with the objectives of minimizing the makespan and the mean flow time of jobs. ...doi:10.5829/idosi.ije.2013.26.02b.11 fatcat:azlm2xhzw5cmlggz3ajbnajqoq
The cyclic nature of the production flow, which ensures a steady production rhythm, enables just-in-time planning and organization of the associated supply chains. ... Assuming that a control action can be taken to adjust transport operation times within a specified time range, the problem of cyclic scheduling of production flows boils down to seeking conditions the ... Figure 5 . 5 (a) Example of a flexible production job-shop and its SCCP model SC b , (b) Gantt charts of cyclic schedules before and after disruption and (c) cyclic steady states corresponding to the Gantt ...doi:10.1177/1687814017746245 fatcat:7s2zbg6mdbfbpkycgmwbzaruhm
In this paper, we analyze steady-state throughput and scheduling of multicluster tools. We consider the case where all wafers follow the same visit flow within a multicluster tool. ... Note to Practitioners-Modeling and scheduling of cluster tools are critical to improving the productivity and to enhancing the design of wafer processing flows and equipment for semiconductor manufacturing ... The multicluster tool scheduling problem cannot be simply viewed as a special case of flow-shop scheduling problem or job-shop scheduling problem  with deterministic processing and interarrival times ...doi:10.1109/tase.2007.906678 fatcat:kzwzvlqbojdrxaqd7himas47je
This is in large part influenced by the algorithms responsible for the routing of data and the scheduling of tasks. ... In this paper, we present several multi-cost algorithms for the joint scheduling of the communication and computation resources that will be used by a Grid task. ... Develder acknowledges the support of the FWO for his post-doctoral grant. K. ...doi:10.1016/j.future.2008.08.004 fatcat:pblldemno5gafowtplcylqm34a
When the schedule of place utilities changes sufficiently, this may induce a change in residence (migration) and/or a job site relocation, leading to alterations in commuting behavior. ... (A is a stable time path, B shows convergence of flows on the 21 pair, and C exhibits non-systematic fluctuations between the 12 flow and the 21 flow.) ...doi:10.1111/j.1538-4632.1971.tb00359.x fatcat:fb3z7g2kn5hj5aqx5akuzbae6u
A dominance relation is developed for the case of three machines and several heuristics and four new effective and efficient genetic algorithms are proposed. ... The genetic algorithms make use of advanced concepts like steady-state and elitist generational scheme as well as new fast-selection operators. ... There are n·(n-1) possible pairs of jobs in a sequence, therefore, the initial test to be carried out is to count how many of these possible pairs actually satisfy the dominance rule. ...doi:10.1007/s00170-006-0726-9 fatcat:erzfsyte4bh2ng3spmwomeedmm
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
In the first part of the paper, we study the impact of scheduling, in a setting of parallel queues with a mix of heavy-tailed and light-tailed traffic. ... In the second part of the paper, we extend the results on Max-Weight and Max-Weightα scheduling to a single-hop network, with arbitrary topology and scheduling constraints. ... Coefficients of the arrival flows. ...doi:10.1109/allerton.2009.5394854 fatcat:3rzw46c2ibegfldygg2uotyz5y
Our heuristic is a combination of a steady-state genetic algorithm and three improvement procedures. ... The two computationally less expensive of these three improvement procedures are used inside the genetic algorithm to improve the schedule obtained after the application of genetic operators, whereas the ... At each iteration, the API procedure starts with the first job in the schedule and considers in succession each pair of adjacent jobs. ...doi:10.1007/s13042-011-0067-3 fatcat:q3utkrgjtfafxgqxyyo4gtpbwy
In this paper we address the cyclic scheduling problem in flow lines. We develop a modeling framework and an integer programming formulation of the problem. ... schedules in flow lines. ... in steady state without actually implementing the schedules. ...doi:10.1002/(sici)1520-6750(199603)43:2<211::aid-nav4>3.0.co;2-d fatcat:n6xkbuusxzb4vdx4daimeo2qna
Thus, depending on the processing needs of the flows going through it, a middlebox will need to make scheduling decisions across multiple resources. ... First, it is not strategy-proof; a flow can manipulate the scheduler to get better service by artificially increasing the amount of resources its packets use. ... Acknowledgement We thank Adam Oliner, Ganesh Ananthanarayanan, and Patrick Wendell for useful feedback on earlier drafts of this paper. ...doi:10.1145/2377677.2377679 fatcat:54jwgz2x6fdxterzjxbdugyshy
« Previous Showing results 1 — 15 out of 11,384 results