Conquest of new frontiers in the universe requires colonization old ones. This article interrogates technoscience desires to explore outer space, and how time territory for discovering extraterrestrials habitable planets are organized through settler colonialism on our own. Examining modern astronomy at Mauna Kea, I argue technoscientific promise Thirty Meter Telescope hinges a temporality late...

An employee is an asset to the company. The success of company in achieving its goals depends largely on ability human (employee) resources perform task assigned him. Indonesian government optimistic rupiah will continue strengthen rp9,100 per dollar, he said. Employee performance assessment analysis using a systemated aggregated sum product (waspas). waspas method used because it can reduce er...

The token protocols in FDDI and FDDI-M support synchronous and asynchronous traffic. However, FDDI suffers from a token-lateness problem, and FDDI-M may starve asynchronous traffic. To remove these two weaknesses, we propose the timely-token protocol. The main feature of this protocol is the addition of information to the token so that each station may determine the reason of an early token arr...

We study the problem of scheduling unit-length tasks with release dates and deadlines subject to precedence constraints and unit communication delays. Two polynomial-time algorithms are de ned: one constructs schedules for graphs with uniform release dates, the other for graphs with arbitrary release dates. They have a special structure: unlike most scheduling algorithms, they do not consider i...

Single machine, distinct due dates, early/lately machine problem and fuzzy environment closely models the situation faced by ‘Just In Time’ manufacturing. The objective of this paper is to sequence the jobs on the machine, so that the total penalty cost be minimum. This cost is composed of the total earliness and the total tardiness cost. An algorithm is developed here to minimize the total pen...

In this paper we consider discrete-continuous scheduling problems defined in [7], where general results and methodology have been presented as well. These problems are characterized by the fact that each job simultaneously requires for its processing at a time discrete and continuous (i.e. continuouslydivisible) resources. We deal with a class of these problems where there are: one discrete res...

We consider two single machine bicriteria scheduling problems in which jobs belong to either of two different disjoint sets, each set having its own performance measure. The problem has been referred to as interfering job sets in the scheduling literature and also been called multi-agent scheduling where each agent’s objective function is to be minimized. In the first problem (P1) we look at mi...

In this talk, an automated negotiation mechanism is presented to solve multiple criterion single machine scheduling problems. We consider a single machine that is utilized by two agents that have own jobs and private objectives. The objective of the first agent consists in minimizing the total weighted completion time of its jobs whereas the objective of the second agent is related to minimizin...

We address questions raised by Lobo et al. in 2012 regarding the NP-hard problem of finding an optimal allocation of workers to machine groups in a job shop so as to minimize Lmax, the maximum job lateness. Lobo et al. formulated a lower bound on Lmax given a worker allocation, and an algorithm to find an allocation yielding the smallest such lower bound. In this article we establish optimality...

A promising approach for an effective shop scheduling that synergizes the benefits of the combinatorial optimization, supervised learning and discrete-event simulation is presented. Though dispatching rules are in widely used by shop scheduling practitioners, only ordinary performance rules are known; hence, dynamic generation of dispatching rules is desired to make them more effective in chang...