𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An improved heuristic for one-machine scheduling with delays constraints

✍ Scribed by Donglei Du; Jiye Han; Bo Chen

Publisher
SP Science China Press
Year
1997
Tongue
English
Weight
383 KB
Volume
40
Category
Article
ISSN
1674-7283

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Heuristics for two-machine no-wait flows
Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
✍ Guoqing Wang; T.C.Edwin Cheng πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 75 KB

In this paper we study the two-machine no-wait flowshop problem with an availability constraint. The problem has been shown to be NP-hard, and some heuristics with a worst-case error bound of 2 have been developed for it. We provide two improved heuristics for the problem, and show that each has a w

An approximation algorithm for schedulin
An approximation algorithm for scheduling two parallel machines with capacity constraints
✍ Heng Yang; Yinyu Ye; Jiawei Zhang πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 205 KB

We consider the problem of scheduling n independent jobs on two identical parallel machines, with a limit on the number of jobs that can be assigned to each single machine, so as to minimize the total weighted completion time of the jobs. We study a semideΓΏnite programming-based approximation algori