๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimizing Chemotherapy Scheduling Using Local Search Heuristics

โœ Scribed by Agur, Zvia; Hassin, Refael; Levy, Sigal

Book ID
118736197
Publisher
INFORMS
Year
2006
Tongue
English
Weight
195 KB
Volume
54
Category
Article
ISSN
0030-364X

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

Heuristic search for scheduling flexible
Heuristic search for scheduling flexible manufacturing systems using lower bound reachability matrix
โœ Jonghyun Lee; Jin S. Lee ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 384 KB

A รƒ algorithm B-net modelling Heuristic search Lower bound reachability matrix a b s t r a c t For scheduling flexible manufacturing systems efficiently, we propose new heuristic functions for A รƒ algorithm that is based on the T-timed Petri net. In minimizing makespan, the proposed heuristic funct