Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
Abstract: We consider the problem of scheduling jobs with equal lengths and arbitrary sizes on uniform parallel batch machines with different capacities. Each machine can only process the jobs whose sizes are not larger than its capacity. Several jobs can be processed as a batch simultaneously on a machine, as long as their total size does not exceed the machine’s capacity. The objective is to minimize makespan. Under a divisibility constraint, we obtain two efficient exact algorithms. For the general problem, we obtain an efficient 2-approximation algorithm. Previous work has shown that the problem cannot be approximated to within an approximation ratio better than 2, unless P = NP, even when all machines have identical speeds and capacities.
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines ; volume:21 ; number:1 ; year:2023 ; extent:11
Open mathematics ; 21, Heft 1 (2023) (gesamt 11)
- Creator
-
Xin, Xiao
Khan, Muhammad Ijaz
Li, Shuguang
- DOI
-
10.1515/math-2022-0562
- URN
-
urn:nbn:de:101:1-2023022813190175273847
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:04 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
- Xin, Xiao
- Khan, Muhammad Ijaz
- Li, Shuguang
Other Objects (12)
Scheduling parallel serial-batch processing machines with incompatible job families, sequence-dependent setup times and arbitrary sizes
Batch scheduling in process industries
Batch scheduling in process industries
Real time scheduling of batch operations
Lotsizing and scheduling by batch sequencing
Approximation in batch and multiprocessor scheduling
Batch scheduling in the histopathology laboratory
Batch production scheduling in the process industries
Discrete lotsizing and scheduling by batch sequencing
Batch scheduling in process industries : an application of resource constrained project scheduling
Prediction of Nanoparticle Sizes for Arbitrary Methacrylates Using Artificial Neuronal Networks
Dynamic scheduling with queueing methods to control nervousness of a batch scheduling system
Scheduling parallel serial-batch processing machines with incompatible job families, sequence-dependent setup times and arbitrary sizes
Batch scheduling in process industries
Batch scheduling in process industries
Real time scheduling of batch operations
Lotsizing and scheduling by batch sequencing
Approximation in batch and multiprocessor scheduling
Batch scheduling in the histopathology laboratory
Batch production scheduling in the process industries
Discrete lotsizing and scheduling by batch sequencing
Batch scheduling in process industries : an application of resource constrained project scheduling
Prediction of Nanoparticle Sizes for Arbitrary Methacrylates Using Artificial Neuronal Networks
Dynamic scheduling with queueing methods to control nervousness of a batch scheduling system
Scheduling parallel serial-batch processing machines with incompatible job families, sequence-dependent setup times and arbitrary sizes
Batch scheduling in process industries
Batch scheduling in process industries
Real time scheduling of batch operations
Lotsizing and scheduling by batch sequencing
Approximation in batch and multiprocessor scheduling
Batch scheduling in the histopathology laboratory
Batch production scheduling in the process industries
Discrete lotsizing and scheduling by batch sequencing
Batch scheduling in process industries : an application of resource constrained project scheduling
Prediction of Nanoparticle Sizes for Arbitrary Methacrylates Using Artificial Neuronal Networks