Approximation algorithms for scheduling with rejection in Green manufacturing

DOI10.1016/J.TCS.2026.116136MaRDI QIDQ7319281zbMATH OpenFDO

Authors Mingyang Gong, Brendan Mumey

Publication date 25 August 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116136

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A unified framework for designing EPTAS for load balancing on parallel machines
• Algorithms for Scheduling Independent Tasks
• An approximation algorithm for the generalized assignment problem
• Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Exact and heuristic solution approaches for energy-efficient identical parallel machine scheduling with time-of-use costs
• Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1875417 (Why is no real title available?)
• Machine scheduling with restricted rejection: an application to task offloading in cloud-edge collaborative computing
• Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\)
• Multiprocessor Scheduling with Rejection
• Parallel machine scheduling with restricted job rejection
• Scheduling problems with rejection in green manufacturing industry

This page was built for publication: Approximation algorithms for scheduling with rejection in Green manufacturing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7319281)