Minimizing total completion time in large-sized pharmaceutical quality control scheduling
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource, 1 online resource.
- Sprache
-
Englisch
- Erschienen in
-
Minimizing total completion time in large-sized pharmaceutical quality control scheduling ; volume:29 ; number:1 ; day:14 ; month:2 ; year:2023 ; pages:177-206 ; date:2.2023
Journal of heuristics ; 29, Heft 1 (14.2.2023), 177-206, 2.2023
- Urheber
-
Martins, Miguel S. E.
Viegas, Joaquim L.
Coito, Tiago
Firme, Bernardo
Costigliola, Andrea
Figueiredo, João
Vieira, Susana M.
Sousa, João M. C.
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10732-023-09509-8
- URN
-
urn:nbn:de:101:1-2023111909333394695509
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:31 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
- Martins, Miguel S. E.
- Viegas, Joaquim L.
- Coito, Tiago
- Firme, Bernardo
- Costigliola, Andrea
- Figueiredo, João
- Vieira, Susana M.
- Sousa, João M. C.
- SpringerLink (Online service)
Ähnliche Objekte (12)
Scheduling with non-renewable resources: minimizing the sum of completion times
Approximation algorithms for coupled task scheduling minimizing the sum of completion times
Road pavement upgrade scheduling accounting for minimizing congestion
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
Minimizing total weighted completion times subject to precedence constraints by dynamic programming
Minimizing total completion time on a single machine with step improving jobs
Column generation for minimizing total completion time in a parallel-batching environment
Trajectory Scheduling Methods for minimizing total tardiness in a flowshop
Approximability of average completion time scheduling on unrelated machines
On-line scheduling to minimize average completion time revisited
A PTAS for minimizing the total weighted completion time on identical parallel machines
Minimizing cache usage with fixed-priority and earliest deadline first scheduling
Scheduling with non-renewable resources: minimizing the sum of completion times
Approximation algorithms for coupled task scheduling minimizing the sum of completion times
Road pavement upgrade scheduling accounting for minimizing congestion
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
Minimizing total weighted completion times subject to precedence constraints by dynamic programming
Minimizing total completion time on a single machine with step improving jobs
Column generation for minimizing total completion time in a parallel-batching environment
Trajectory Scheduling Methods for minimizing total tardiness in a flowshop
Approximability of average completion time scheduling on unrelated machines
On-line scheduling to minimize average completion time revisited
A PTAS for minimizing the total weighted completion time on identical parallel machines
Minimizing cache usage with fixed-priority and earliest deadline first scheduling
Scheduling with non-renewable resources: minimizing the sum of completion times
Approximation algorithms for coupled task scheduling minimizing the sum of completion times
Road pavement upgrade scheduling accounting for minimizing congestion
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
Minimizing total weighted completion times subject to precedence constraints by dynamic programming
Minimizing total completion time on a single machine with step improving jobs
Column generation for minimizing total completion time in a parallel-batching environment
Trajectory Scheduling Methods for minimizing total tardiness in a flowshop
Approximability of average completion time scheduling on unrelated machines
On-line scheduling to minimize average completion time revisited
A PTAS for minimizing the total weighted completion time on identical parallel machines