Column generation for minimizing total completion time in a parallel-batching environment
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1099-1425
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Column generation for minimizing total completion time in a parallel-batching environment ; volume:24 ; number:6 ; day:1 ; month:10 ; year:2021 ; pages:569-588 ; date:12.2021
Journal of scheduling ; 24, Heft 6 (1.10.2021), 569-588, 12.2021
- Urheber
-
Alfieri, A.
Druetto, A.
Grosso, A.
Salassa, F.
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10951-021-00703-9
- URN
-
urn:nbn:de:101:1-2022012618345571577030
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:37 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Alfieri, A.
- Druetto, A.
- Grosso, A.
- Salassa, F.
- SpringerLink (Online service)
Ähnliche Objekte (12)
A PTAS for minimizing the total weighted completion time on identical parallel machines
Scheduling with non-renewable resources: minimizing the sum of completion times
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
Minimizing total completion time in large-sized pharmaceutical quality control scheduling
Minimizing total weighted completion times subject to precedence constraints by dynamic programming
Approximation algorithms for coupled task scheduling minimizing the sum of completion times
Minimizing total completion time on a single machine with step improving jobs
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
Obtaining Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low Rank Matrix Completion
Parental job loss, secondary school completion and home environment
Minimizing energy
Term completion versus algebraic completion
A PTAS for minimizing the total weighted completion time on identical parallel machines
Scheduling with non-renewable resources: minimizing the sum of completion times
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
Minimizing total completion time in large-sized pharmaceutical quality control scheduling
Minimizing total weighted completion times subject to precedence constraints by dynamic programming
Approximation algorithms for coupled task scheduling minimizing the sum of completion times
Minimizing total completion time on a single machine with step improving jobs
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
Obtaining Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low Rank Matrix Completion
Parental job loss, secondary school completion and home environment
Minimizing energy
Term completion versus algebraic completion
A PTAS for minimizing the total weighted completion time on identical parallel machines
Scheduling with non-renewable resources: minimizing the sum of completion times
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
Minimizing total completion time in large-sized pharmaceutical quality control scheduling
Minimizing total weighted completion times subject to precedence constraints by dynamic programming
Approximation algorithms for coupled task scheduling minimizing the sum of completion times
Minimizing total completion time on a single machine with step improving jobs
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
Obtaining Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low Rank Matrix Completion
Parental job loss, secondary school completion and home environment
Minimizing energy