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

A new heuristic for the n-job, M-machine flow-shop problem

โœ Scribed by Johnny C. Ho; Yih-Long Chang

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
508 KB
Volume
52
Category
Article
ISSN
0377-2217

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

Classical and new heuristics for the ope
Classical and new heuristics for the open-shop problem: A computational evaluation
โœ Christelle Guรฉret; Christian Prins ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 111 KB

We study the problem of constructing minimum makespan schedules for the Open-Shop problem. This paper presents two new heuristics: the ยฎrst one is a list scheduling algorithm with two priorities. The second is based on the construction of matchings in a bipartite graph. We develop several versions o