Heuristic scheduling of jobs on parallel batch machines with ...
Recommend Documents
We address the problem of scheduling n identical jobs on m uniform parallel machines to optimize scheduling criteria that are nondecreasing in the job.
a set N of n jobs on a set M of m machines that are disposed in parallel. Each job ..... The model involves the following decision variables: Xijk = ...... Yi, Y., Wang, D.W.: Soft computing for scheduling with batch setup times and earliness-.
Apr 3, 1998 - Consider the execution of a parallel application that dynamically generates parallel jobs with speci ed resource requirements during its.
We can modify our algorithms by this tech- nique so that .... For technical simplicity, we assume without loss of generality that both the ..... J(blog nc) by J(l) = fJij n ...... 11] F.T. Leighton, Complexity Issues in VLSI (Foundations of Computing
N1 have to be processed on the first machine, jobs from the subset N2 on the second .... to be inadvisable to try to construct an effective solution algorithm for.
that an earlier open problem of scheduling jobs with two possible processing ... integer job processing times p and q, p
ever, can be encoded more succinctly by O( n ) numbers: for each job, we need to specify its .... Finally, the jobs are scheduled using (an adaption of) Graham's greedy schedul- .... optimality; for a proof we refer to a full version of the paper.
1School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213. ... good results if the mapping of the requested processors on the smaller set.
ing of moldable jobs focused on when and how to choose ... Proceedings of the IEEE International Conference on Cluster Computing (CLUSTER'03).
Heuristic scheduling of jobs on parallel batch machines with ...
May 28, 2004 - Computers & Operations Research 32 (2005) 2731â2750 ... Therefore, this research proposes two heuristic approaches that lead to good.
Computers & Operations Research 32 (2005) 2731 – 2750
www.elsevier.com/locate/dsw
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times Lars M*oncha;∗ , Hari Balasubramanianb , John W. Fowlerb , Michele E. Pfundb a
Institute of Information Systems, Technical University of Ilmenau, 98684 Ilmenau, Germany b Department of Industrial Engineering, Arizona State University, Tempe, AZ 85287, USA Available online 28 May 2004
Abstract This research is motivated by a scheduling problem found in the di6usion and oxidation areas of semiconductor wafer fabrication, where the machines can be modeled as parallel batch processors. We attempt to minimize total weighted tardiness on parallel batch machines with incompatible job families and unequal ready times of the jobs. Given that the problem is NP-hard, we propose two di6erent decomposition approaches. The
