𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling ordered open shops

✍ Scribed by C.Y. Liu; R.L. Bulfin

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
654 KB
Volume
14
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Open shop scheduling with maximal machin
Open shop scheduling with maximal machines
✍ George J. Kyparisis; Christos Koulamas πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 698 KB

## The objective of this paper is to develop polynomial algorithms for the open shop makespan problem. It is shown that when a machine majorizes all other machines and the ith largest processing time on that machine is at least as large as the processing times of all operations on machines i throu

Open shop scheduling problems with late
Open shop scheduling problems with late work criteria
✍ Jacek BΕ‚aΕΌewicz; Erwin Pesch; MaΕ‚gorzata Sterna; Frank Werner πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 354 KB

The paper concerns the application of a non-classical performance measure, a late work criterion (Y; Yw), to scheduling problems. It estimates the quality of the obtained solution with regard to the duration of the late parts of tasks not taking into account the quantity of this delay. The paper pro