Speech communication is so valuable to humans because it is possible in a very wide range of circumstances, including all kinds of adverse acoustic conditions including unrelated background noises, highly reverberant environments, and competing incidental speech. For speech interfaces to machines to reach their full potential, the machines must be able to understand spoken commands in a range o...

We study the problem of fairness design. Specifically, we focus on approximation algorithms for indivisible items with supporting envy-free bundle prices. We present the first polynomial-communication envy-free profit-maximizing combinatorial auctions for general bidders. In this context, envy-free prices can be interpreted as anonymous nondiscriminatory prices. Additionally, we study the canon...

This study considers scheduling in Hybrid flow shop environment with unrelated parallel machines for minimizing mean of job's tardiness and mean of job's completion times. This problem does not study in the literature, so far. Flexible flow shop environment is applicable in various industries such as wire and spring manufacturing, electronic industries and production lines. After modeling the p...

In this paper, we consider scheduling problems with general truncated job-dependent learning effect on unrelated parallel-machine. The objective functions are to minimize total machine load, total completion (waiting) time, total absolute differences in completion (waiting) times respectively. If the number of machines is fixed, these problems can be solved in m O n 2 ( ) + time respectively, w...

We study the problem of scheduling a set of J jobs on M machines with stochastic job processing times when no preemptions are allowed and the weighted sum of expected completion time objective. Our model allows for “unrelated” machines: the distributions of processing times may vary across both jobs and machines. We study static routing policies, which assign (or “route”) each job to a particul...

Parallel machines concept is a well-known and widely used system in the manufacturing facilities. Scheduling of these parallel machines has been a key activity in the successful product outcome. Though jobs are executed on schedules, in certain cases the completion time increases resulting in tardiness. This survey work identifies and compiles the optimization strategies and solution approaches...

m unrelated parallel machines scheduling problems with variable job processing times are considered, where the processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation. The objective is to determine the optimal resource allocation and the optimal schedule to minimize a total cost function that dependents on the total completion (waitin...

Parallel environment (alpha in Graham’s notation): • P parallel identical • Q uniform machines: each machine has a given speed speed i, and all jobs have a size sizej, the processing time is given by sizej/speed i • R unrelated machines: the processing time of job j on machine i is given by pi,j, without any other constraints Sometimes the number of processors is fixed: for example, P2, F2, or Pm.

We consider the problem of scheduling n independent jobs on m unrelated parallel machines with sequence-dependent setup times and availability dates for the machines and release dates for the jobs to minimize a regular additive cost function. In this work, we develop a new branch-and-price optimization algorithm for the solution of this general class of parallel machines scheduling problems. A ...

This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...