The scheduling problem where multiple machines compete for a common local buffer (Q1127173): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q4658190 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Simultaneous Resource Scheduling to Minimize Weighted Flow Times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Surrogate Mathematical Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Flowshop scheduling with limited temporary storage / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(93)e0352-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064094328 / rank | |||
Normal rank | |||
Latest revision as of 10:25, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The scheduling problem where multiple machines compete for a common local buffer |
scientific article |
Statements
The scheduling problem where multiple machines compete for a common local buffer (English)
0 references
13 August 1998
0 references
scheduling jobshops
0 references
restricted buffer space
0 references
two-stage flowshop
0 references
multiple machines
0 references
sum of weighted completion times
0 references
