Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2916
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost ; day:6 ; month:7 ; year:2018 ; pages:1-20
Journal of global optimization ; (6.7.2018), 1-20
- Creator
-
Shioura, Akiyoshi
- Contributor
- DOI
-
10.1007/s10898-018-0686-2
- URN
-
urn:nbn:de:101:1-2018091519421206800547
- Rights
-
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
- Shioura, Akiyoshi
- Shakhlevich, Natasha
- Strusevich, Vitaly A.
- SpringerLink (Online service)
Other Objects (12)
Scheduling Parallel Jobs to Minimize Makespan
On-line scheduling to minimize average completion time revisited
Mathematical models for a batch scheduling problem to minimize earliness and tardiness
Single machine batch scheduling to minimize the weighted number of tardy jobs
A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem
An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms
Preemptive scheduling of parallel jobs of two sizes with controllable processing times
Bi-criteria parallel batch machine scheduling to minimize total weighted tardiness and electricity cost
Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time
Scheduling Parallel Jobs to Minimize Makespan
On-line scheduling to minimize average completion time revisited
Mathematical models for a batch scheduling problem to minimize earliness and tardiness
Single machine batch scheduling to minimize the weighted number of tardy jobs
A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem
An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms
Preemptive scheduling of parallel jobs of two sizes with controllable processing times
Bi-criteria parallel batch machine scheduling to minimize total weighted tardiness and electricity cost
Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time
Scheduling Parallel Jobs to Minimize Makespan
On-line scheduling to minimize average completion time revisited
Mathematical models for a batch scheduling problem to minimize earliness and tardiness
Single machine batch scheduling to minimize the weighted number of tardy jobs
A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem
An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms
Preemptive scheduling of parallel jobs of two sizes with controllable processing times
Bi-criteria parallel batch machine scheduling to minimize total weighted tardiness and electricity cost