Multitasking scheduling with alternate periods

In this paper, we consider the multitasking scheduling with alternate odd-period and even-period. For the minimization of makespan on one single machine, we present a 2-approximation algorithm for the general case and a 4 3 -approximation algorithm for a special case when jobs have identical release...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 45; no. 3; p. 92
Main Authors:	Huo, Yujia, Miao, Cuixia, Kong, Fanyu, Zhang, Yuzhong
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2023 Springer Nature B.V
Subjects:	Algorithms Approximation Combinatorics Convex and Discrete Geometry Dynamic programming Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Multitasking Operations Research/Decision Theory Optimization Polynomials Scheduling Theory of Computation Strongly NP-hard Multitasking scheduling Approximation algorithm Pseudo-polynomial-time algorithm
ISSN:	1382-6905, 1573-2886
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!