𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs

✍ Scribed by Ming-bao Cheng; Shi-jie Sun

Publisher
Chinese Electronic Periodical Services
Year
2007
Tongue
English
Weight
201 KB
Volume
11
Category
Article
ISSN
1007-6417

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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