𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two machine open shop scheduling problem with bi-criteria

✍ Scribed by Teruo Masuda; Hiroaki Ishii

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
363 KB
Volume
52
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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