Scheduling;
Approximation;
Resource constraint;
OPEN SHOP;
APPROXIMATION;
MINIMIZE;
CLASSIFICATION;
D O I:
10.1016/j.orl.2023.06.001
中图分类号:
C93 [管理学];
O22 [运筹学];
学科分类号:
070105 ;
12 ;
1201 ;
1202 ;
120202 ;
摘要:
We study a basic scheduling problem with resource constraints: A number of jobs need to be scheduled on two parallel identical machines with the objective of minimizing the makespan, subject to the constraint that jobs may require a unit of one of the given renewable resources during their execution. For this NP-hard problem, we develop a fully polynomial-time approximation scheme (FPTAS). Our FPTAS makes a novel use of existing algorithms for the subset-sum problem and the open shop scheduling problem. & COPY; 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons .org /licenses /by /4 .0/).
机构:
Univ Evry, IBISC, Univ Paris Saclay, F-91025 Evry, FranceUniv Evry, IBISC, Univ Paris Saclay, F-91025 Evry, France
Angel, Eric
Morais, Sebastien
论文数: 0引用数: 0
h-index: 0
机构:
DIF, CEA, DAM, F-91297 Arpajon, France
Univ Paris Saclay, LIHPC Lab Informat Haute Performance Calcul & Sim, DAM Ile France, Bruyeres Le Chatel, FranceUniv Evry, IBISC, Univ Paris Saclay, F-91025 Evry, France
Morais, Sebastien
Regnault, Damien
论文数: 0引用数: 0
h-index: 0
机构:
Univ Evry, IBISC, Univ Paris Saclay, F-91025 Evry, FranceUniv Evry, IBISC, Univ Paris Saclay, F-91025 Evry, France
机构:
Natl Pingtung Inst Commerce, Dept Business Adm, 51 Min Sheng E Rd, Pingtung, TaiwanNatl Pingtung Inst Commerce, Dept Business Adm, 51 Min Sheng E Rd, Pingtung, Taiwan