We propose a model for non-preemptive scheduling under uncertainty. In this model, we combine the main characteristics of online and stochastic scheduling in a simple and natural way. Job processing times are assumed to be stochastic, but in contrast to the traditional stochastic scheduling models, we assume that jobs arrive online over time, and there is no knowledge about the jobs that will a...

The liquid crystal display module scheduling problem (LCMSP) is a variation of the classical parallel machines scheduling problem, which has many real-world applications, particular, in the thin film transistor liquid crystal display (TFT-LCD) manufacturing industry. In this paper, we present a case study on the LCMSP, which is taken from a final liquid crystal display module (LCM) shop floor i...

We present an unified approach to study online scheduling problems in the resource augmentation/speed scaling models. Potential function method is extensively used for analyzing algorithms in these models; however, they yields little insight on how to construct potential functions and how to design algorithms for related problems. In the paper, we generalize and strengthen the dual-fitting tech...

Coupled-tasks were introduced by Shapiro in 1980 for scheduling the operations of a radar [19]. The radar emits a pulse that is transmitted to a target and reflected back to the radar, which receives the pulse. Hence the radar must process two operations per task (emission and reception), and those operations are separated by a fixed duration. The coupled task scheduling problem is then to proc...

 This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...

In many scheduling applications, a large number of jobs are grouped into a comparatively small number of lots, made of identical items. It is then sufficient to give, for each lot, the number of jobs it involves plus the description of one single job. The resulting high-multiplicity input format is much more compact than the standard one. As a consequence, in order to be efficient, standard sol...

In parallel machine scheduling, we are given a set of jobs, together with number machines and our goal is to decide for each job, when on which machine(s) it should be scheduled in order minimize some objective function. Different models, job characteristics functions result multitude scheduling problems many them NP-hard, even fixed identical machines. this work, give conditional running time ...

In this paper, we consider the online version of the machine minimization problem (introduced by Chuzhoy et al, FOCS 2004), where the goal is to schedule a set of jobs with release times, deadlines, and processing lengths on a minimum number of identical machines. Since the online problem has strong lower bounds if all the job parameters are arbitrary, we focus on jobs with uniform length. Our ...