𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The mixed shop scheduling problem

✍ Scribed by Teruo Masuda; Hiroaki Ishii; Toshio Nishida

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

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

Solving the open shop scheduling problem
Solving the open shop scheduling problem
✍ Ulrich Dorndorf; Erwin Pesch; ToΓ n Phan-Huy πŸ“‚ Article πŸ“… 2001 πŸ› Springer US 🌐 English βš– 128 KB

Only few exact solution methods are available for the open shop scheduling problem. We describe a branch-and-bound algorithm for solving this problem which performs better than other existing algorithms. The key to the e ciency of our algorithm lies in the following approach: instead of analysing an

Benchmarks for shop scheduling problems
Benchmarks for shop scheduling problems
✍ Ebru Demirkol; Sanjay Mehta; Reha Uzsoy πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 468 KB