Minimizing resource consumption on uniform parallel machines with a bound on makespan

DOI10.1016/J.COR.2013.06.011MaRDI QIDQ336672zbMATH OpenOpenAlexFDO

Authors Min Ji, Jen-Ya Wang, Wen-Chiung Lee

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2013.06.011

zbMATH Keywords

schedulingmakespanresource consumptionuniform parallel machine

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Uniform parallel machine scheduling with resource consumption constraint
• On minimizing resource consumption with constraints on the makespan and the total completion time
• Resource optimal control in some single-machine scheduling problems
• Sustainable machine scheduling problem to minimize carbon emission
• Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1783886 (Why is no real title available?)
• A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
• A modified LPT algorithm for the two uniform parallel machine makespan minimization problem
• A state-of-the-art review of parallel-machine scheduling research
• Iterated greedy local search methods for unrelated parallel machine scheduling
• Parallel machine scheduling with machine availability and eligibility constraints
• Scheduling identical parallel machines and operators within a period based changing mode
• Simplified swarm optimization in disassembly sequencing problems with learning effects
• Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics

Cited in

(12)

• On the mass COVID-19 vaccination scheduling problem
• Bi-objective scheduling on uniform parallel machines considering electricity cost
• Uniform parallel machine scheduling with resource consumption constraint
• A bi-objective heuristic approach for green identical parallel machine scheduling
• Unrelated parallel machine energy-efficient scheduling considering sequence-dependent setup times and time-of-use electricity tariffs
• An efficient approximation algorithm for minimizing makespan on uniformly related machines.
• Production planning under RTP, TOU and PPA considering a redox flow battery storage system
• Multi-project scheduling problem under shared multi-skill resource constraints
• Approximate dynamic programming for an energy-efficient parallel machine scheduling problem
• Energy-efficient scheduling in manufacturing companies: a review and research framework
• Heuristic methods for the single-machine scheduling problem with periodical resource constraints
• Exact method to optimize the total electricity cost in two-machine permutation flow shop scheduling problem under time-of-use tariff

This page was built for publication: Minimizing resource consumption on uniform parallel machines with a bound on makespan

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