Uniform-machine scheduling problems in green manufacturing system

DOI10.3934/MFC.2024020MaRDI QIDQ6952955zbMATH OpenFDO

Authors Cuixia Miao, Fanyu Kong

Publication date 25 July 2025

Published in Mathematical Foundations of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/MFC.2024020

zbMATH Keywords

approximation algorithmgreen manufacturing systemmakespanpreemptiveuniform-machine scheduling

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Cites work

• A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
• A simulated annealing approach to minimize the maximum lateness on uniform parallel machines
• Better Online Algorithms for Scheduling with Machine Cost
• scientific article; zbMATH DE number 3633982 (Why is no real title available?)
• scientific article; zbMATH DE number 2114378 (Why is no real title available?)
• scientific article; zbMATH DE number 1418274 (Why is no real title available?)
• New upper and lower bounds for online scheduling with machine cost
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine selection and job scheduling to minimize machine cost and job tardiness
• Scheduling on uniform parallel machines to minimize maximum lateness
• Scheduling with machine cost and rejection
• Single machine scheduling problem with release dates and two hierarchical criteria to minimize makespan and stocking cost
• The generalization of scheduling with machine cost
• Uniform parallel machine scheduling problems with fixed machine cost

This page was built for publication: Uniform-machine scheduling problems in green manufacturing system

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