Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (Q1362988): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A survey of results for sequencing problems with controllable processing times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A bicriterion approach to time/cost trade-offs in sequencing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine / rank | |||
Normal rank | |||
Revision as of 17:05, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single-machine scheduling with trade-off between number of tardy jobs and resource allocation |
scientific article |
Statements
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (English)
0 references
7 August 1997
0 references
sequencing
0 references
time-cost trade-offs
0 references
resource allocation
0 references
single-machine scheduling
0 references
NP-hardness
0 references
pseudo-polynomial-time dynamic programming algorithm
0 references
0 references
0 references
