Scheduling unit time open shops to minimize the weighted number of late jobs (Q1318657): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Open shop problems with unit time operations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Note On The Complexity Of Openshop Scheduling Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates / rank | |||
Normal rank | |||
Revision as of 14:21, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling unit time open shops to minimize the weighted number of late jobs |
scientific article |
Statements
Scheduling unit time open shops to minimize the weighted number of late jobs (English)
0 references
6 April 1994
0 references
unit processing times
0 references
polynomial algorithm
0 references
open shop
0 references
fixed number of machines
0 references
weighted number of late jobs
0 references
