We consider the well-studied game-theoretic version of machine scheduling in which jobs correspond to self-interested users and machines correspond to resources. Here each user chooses a machine trying to minimize her own cost, and such selfish behavior typically results in some equilibrium which is not globally optimal : An equilibrium is an allocation where no user can reduce her own cost by ...

abstract: this paper considers the problem of scheduling n jobs on m unrelated parallel machines with sequence-dependent setup times. to better comply with industrial situations, jobs have varying due dates and ready times and there are some precedence relations between them. furthermore sequence-dependent setup times and anticipatory setups are included in the proposed model. the objective is ...

The unrelated parallel machine scheduling problem (UPMSP) is a typical production with certain symmetries on machines. Additional resources and preventive maintenance (PM) extensively exist machines; however, UPMSP additional PM has been scarcely investigated. Adaptive competition also seldom implemented in the artificial bee colony algorithm for scheduling. In this study, investigated, which A...

This paper studies the problem of scheduling N jobs in a hybrid flowshop with unrelated parallel machines at each stage. Considering practical application presented problem, no-wait constraints and objective function total flowtime are included problem. A mathematical model is constructed novel genetic simulated annealing algorithm so-called GSAA developed to solve this In algorithm, firstly mo...

This scheduling model is derived from the real problem of scheduling looms in a textile industry. Jobs may be independently split over several specified machines and preemption is allowed. Deadlines are specified for each job and jobs are assumed to be available. It is shown that minimizing maximum weighted tardiness can be done in polynomial time. The case of uniform machines (as in the consid...

In this work we give a tight lower bound on makespan approximations for envy-free allocation mechanism dedicated to scheduling tasks on unrelated machines. Specifically, we show that no mechanism exists that can guarantee an envy-free allocation of jobs to m machines with a makespan of less than a factor of O(logm) of the minimal makespan. Combined with previous results, this paper definitively...

We examine the influence of domain-specific knowledge on the process of learning and representing simple visual categories. Depending on whether subjects’ construe simple objects as living kinds or machines, they show differential sensitivity to the importance of basic shape features. In particular, subjects who treated the objects as machines placed less importance on coarse shape differences ...