Minimizing the weighted number of late jobs in UET open shops (Q4698122): 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: Scheduling unit time open shops to minimize the weighted number of late jobs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Unit Execution Time Shop Problems / 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:25, 23 May 2024
scientific article; zbMATH DE number 754925
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the weighted number of late jobs in UET open shops |
scientific article; zbMATH DE number 754925 |
Statements
Minimizing the weighted number of late jobs in UET open shops (English)
0 references
25 June 1995
0 references
two-machine open shop
0 references
release dates and due dates
0 references
weighted number of late jobs
0 references
polynomial time algorithm
0 references
