Minimizing resource consumption on uniform parallel machines with a bound on makespan
From MaRDI portal
Publication:336672
DOI10.1016/J.COR.2013.06.011zbMath1348.90273OpenAlexW2096302562MaRDI QIDQ336672
Jen-Ya Wang, Min Ji, 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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
Approximate dynamic programming for an energy-efficient parallel machine scheduling problem ⋮ Bi-objective scheduling on uniform parallel machines considering electricity cost ⋮ Exact method to optimize the total electricity cost in two-machine permutation flow shop scheduling problem under time-of-use tariff ⋮ Energy-efficient scheduling in manufacturing companies: a review and research framework ⋮ On the mass COVID-19 vaccination scheduling problem ⋮ Production planning under RTP, TOU and PPA considering a redox flow battery storage system ⋮ Multi-project scheduling problem under shared multi-skill resource constraints ⋮ Heuristic methods for the single-machine scheduling problem with periodical resource constraints ⋮ A bi-objective heuristic approach for green identical parallel machine scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling identical parallel machines and operators within a period based changing mode
- A state-of-the-art review of parallel-machine scheduling research
- Iterated greedy local search methods for unrelated parallel machine scheduling
- A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
- Simplified swarm optimization in disassembly sequencing problems with learning effects
- Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics
- A modified LPT algorithm for the two uniform parallel machine makespan minimization problem
- Parallel machine scheduling with machine availability and eligibility constraints
This page was built for publication: Minimizing resource consumption on uniform parallel machines with a bound on makespan
