Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
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, a...
Main Authors: | Xin Xiao, Khan Muhammad Ijaz, Li Shuguang |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2023-02-01
|
Series: | Open Mathematics |
Subjects: | |
Online Access: | https://doi.org/10.1515/math-2022-0562 |
Similar Items
-
Schedule Execution for Two-Machine Job-Shop to Minimize Makespan with Uncertain Processing Times
by: Yuri N. Sotskov, et al.
Published: (2020-08-01) -
cheduling uniform machines with restricted assignment
by: Shuguang Li, et al.
Published: (2022-07-01) -
Novel Heuristic Algorithm for Flexible Job Shop Scheduling based on the Longest Processing Time Rules to Minimize Makespan
by: Eka Pakpahan, et al.
Published: (2023-03-01) -
Better polynomial algorithms for scheduling unit-length jobswith bipartite incompatibility graphs on uniform machines
by: T. Pikies, et al.
Published: (2019-02-01) -
Multi-Objective Flexible Job Shop Scheduling Using Genetic Algorithms
by: Attia Boudjemline, et al.
Published: (2022-01-01)