Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times ; day:13 ; month:9 ; year:2024 ; pages:1-13
Optimization letters ; (13.9.2024), 1-13
- Creator
-
Gerstl, Enrique
Mosheiov, Gur
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s11590-024-02138-5
- URN
-
urn:nbn:de:101:1-2411272102327.845790337639
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 15.08.2025, 7:25 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Gerstl, Enrique
- Mosheiov, Gur
- SpringerLink (Online service)
Other Objects (12)
Minimizing the number of late jobs in a stochastic setting using a chance constraint
Minimizing Movements for the Generalized Power Mean Curvature Flow
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
Minimizing the expected waiting time of emergency jobs
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
A New Generalized Intuitionistic Fuzzy Number
Minimizing energy
Minimizing the Number of Apertures in Multileaf Collimator Sequencing with Field Splitting
Optimal number of job changes
The clique number of generalized Hamming graphs
Minimizing the number of late jobs in a stochastic setting using a chance constraint
Minimizing Movements for the Generalized Power Mean Curvature Flow
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
Minimizing the expected waiting time of emergency jobs
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
A New Generalized Intuitionistic Fuzzy Number
Minimizing energy
Minimizing the Number of Apertures in Multileaf Collimator Sequencing with Field Splitting
Optimal number of job changes
The clique number of generalized Hamming graphs
Minimizing the number of late jobs in a stochastic setting using a chance constraint
Minimizing Movements for the Generalized Power Mean Curvature Flow
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
Minimizing the expected waiting time of emergency jobs
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
A New Generalized Intuitionistic Fuzzy Number
Minimizing energy
Minimizing the Number of Apertures in Multileaf Collimator Sequencing with Field Splitting
Optimal number of job changes