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

Authors:
Min Ji;Jen-Ya Wang;Wen-Chiung Lee
Affiliations:
-;-;-
Venue:
Computers and Operations Research
Year:
2013

Citing 8
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A discrete particle swarm optimization algorithm for scheduling parallel machines

Computers and Industrial Engineering
A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines

Computers and Operations Research
Scheduling identical parallel machines and operators within a period based changing mode

Computers and Operations Research
Size-reduction heuristics for the unrelated parallel machines scheduling problem

Computers and Operations Research
Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics

Computers and Operations Research
Simplified swarm optimization in disassembly sequencing problems with learning effects

Computers and Operations Research
Application of particle swarm optimization and simulated annealing algorithms in flow shop scheduling problem under linear deterioration

Advances in Engineering Software

Quantified Score

Hi-index	0.01

Visualization

Abstract

With the crucial issue of environmental protection, managing natural resources efficiently and/or reducing the amount of carbon emissions have become more important than ever. In this paper, we introduce a uniform parallel machine scheduling problem where the objective is to minimize resource consumption given that the maximum completion time does not exceed a certain level. We show that the problem is strongly NP-hard. A tight lower bound and a particle swarm optimization algorithm are then developed. Finally, some computational results are provided.