September 16, 2022Open Access

Two-machine flow shop scheduling with convex resource consumption functions

Key Points

Key points are not available for this paper at this time.

Abstract

Abstract We consider a two-machine flow shop scheduling problem in which the processing time of each operation is inversely proportional to the power of the amount of resources consumed by it. The objective is to minimize the sum of the makespan and the total resource consumption cost. We show that the problem is NP-hard, and its constrained version remains so. Then, we develop 1.25- and 2-approximation algorithms for the problem and its constrained version, respectively.

Bookmark

View Full Paper

Cite This Study

Choi et al. (Fri,) studied this question.

synapsesocial.com/papers/69d77fc3f07a12db70b8b106 https://doi.org/https://doi.org/10.1007/s11590-022-01934-1

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

Bookmark

View Full Paper