A polynomial time algorithm for solving a quality control Station configuration problem (Q2473038): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2007.08.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1975453064 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimizing the quality control station configuration / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4003318 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal inspection policies in a serial production system including scrap rework and repair: An MILP approach / rank | |||
Normal rank | |||
Latest revision as of 17:58, 27 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time algorithm for solving a quality control Station configuration problem |
scientific article |
Statements
A polynomial time algorithm for solving a quality control Station configuration problem (English)
0 references
26 February 2008
0 references
quality control
0 references
serial production line
0 references
polynomial algorithm
0 references
