Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine (Q6664884)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine |
scientific article; zbMATH DE number 7968691
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine |
scientific article; zbMATH DE number 7968691 |
Statements
Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine (English)
0 references
16 January 2025
0 references
lot scheduling
0 references
bicriteria scheduling
0 references
job size
0 references
total completion time
0 references
maximum cost
0 references
0 references
0 references
0 references
0 references
