Scheduling problems with rejection in green manufacturing industry

Green manufacturing is used to describe an environmentally friendly manufacturing approach, which explicitly considers the impact of production on the environment and resources. Therefore, the production scheduling of solving energy conscious is in line with the focus of green manufacturing. In this...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of combinatorial optimization Ročník 49; číslo 4; s. 63
Hlavní autori: Kong, Fanyu, Song, Jiaxin, Miao, Cuixia, Zhang, Yuzhong
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.05.2025
Springer Nature B.V
Predmet:
Algorithms
Approximation
Combinatorics
Convex and Discrete Geometry
Costs
Energy consumption
Knapsack problem
Linear programming
Manufacturing
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Polynomials
Production scheduling
Rejection
Scheduling
Theory of Computation
Green manufacturing
Scheduling
Approximation algorithm
Rejection penalty
Pseudo-polynomial time algorithm
ISSN:1382-6905, 1573-2886
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Green manufacturing is used to describe an environmentally friendly manufacturing approach, which explicitly considers the impact of production on the environment and resources. Therefore, the production scheduling of solving energy conscious is in line with the focus of green manufacturing. In this paper, we consider the scheduling problems with rejection in the green manufacturing industry. The objective is to minimize the makespan of the accepted jobs plus the total rejection penalty of the rejected jobs, subject to the constraint that the total machine cost of the processed jobs is not more than a given threshold. We present pseudo-polynomial time algorithms and 2-approximation algorithms for the single-machine and the parallel-machine problems, respectively.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-025-01295-2