𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Analysis of a linear programming heuristic for scheduling unrelated parallel machines

✍ Scribed by C.N. Potts

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
717 KB
Volume
10
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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

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