Single machine scheduling with start time dependent processing times: Some solvable cases (Q1342026): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)90048-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012767650 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4057549 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4051876 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Single machine scheduling with start time dependent processing times: Some solvable cases / rank | |||
Normal rank | |||
Latest revision as of 10:18, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single machine scheduling with start time dependent processing times: Some solvable cases |
scientific article |
Statements
Single machine scheduling with start time dependent processing times: Some solvable cases (English)
0 references
11 January 1995
0 references
single machine scheduling
0 references
processing time penalties
0 references
due date
0 references
polynomial time optimal algorithms
0 references
0 references
0 references
