✦ LIBER ✦

Heuristics for scheduling unrelated parallel machines

✍ Scribed by A.M.A. Hariri; C.N. Potts

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 961 KB
Volume: 18
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(91)90034-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of a linear programming heurist

Analysis of a linear programming heuristic for scheduling unrelated parallel machines

✍ C.N. Potts 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 717 KB

A local search heuristic for unrelated p

A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search

✍ N. Piersma; W. van Dijk 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 826 KB

The parallel mechine scheduling problem with unrelated machines is studied where the objective is to minimize the maximum makespan. In this paper, new local search algorithms are proposed where the neighborhood search of a solution uses the "efficiency" of the machinea for each job. It is shown that

Genetic algorithms for the job-shop sche

Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: Heuristic mixing method machines and precedence

✍ Fatima Ghedjati 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 360 KB

In this paper, we are interested in job-shop scheduling problems with several unrelated parallel machines and precedence constraints between the operations of the jobs (with either linear or non-linear process routings). The objective is to minimize the maximum completion time (Cmax). We propose an

Heuristics for unrelated machine schedul

Heuristics for unrelated machine scheduling with precedence constraints

✍ Jeffrey Herrmann; Jean-Marie Proth; Nathalie Sauer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 612 KB

Scheduling under a common due-data on pa

Scheduling under a common due-data on parallel unrelated machines

✍ George I. Adamopoulos; Costas P. Pappis 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 486 KB

Due-date determination problems have gained significant attention in recent years due to the industrial focus in the just-in-time philosophy. In this paper the problem of scheduling a set of independent jobs on parallel unrelated processors under a common due-date is examined. The common due-date is

A min-sum 3/2-approximation algorithm fo

A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines

✍ Fabián A. Chudak 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 70 KB 👁 1 views

We consider the problem of minimizing the sum of weighted completion times of jobs scheduled on unrelated parallel machines. That is, there are n jobs and m machines; job j takes p GH units of time if processed on machine i and has a weight w H . If C H is the completion time of job j, the objective