On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. (Q1413926): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401496743 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The complexity of one-machine batching problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Batching identical jobs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2734595 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower bounds for scheduling a single robot in a job-shop environment / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Batch sizing and job sequencing on a single machine / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4055377 / rank | |||
Normal rank | |||
Revision as of 11:37, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. |
scientific article |
Statements
On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. (English)
0 references
17 November 2003
0 references
Scheduling
0 references
Precedence constraints
0 references
Batches
0 references
0 references
