Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing
From MaRDI portal
Publication:6556084
Cites work
- A new modeling and solution approach for the set-partitioning problem
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- A survey of scheduling with parallel batch (p-batch) processing
- An approximation algorithm for the generalized assignment problem
- An improved heuristic for parallel machine scheduling with rejection
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation schemes for scheduling on parallel machines
- Coordinated scheduling of the outsourcing, in-house production and distribution operations
- 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
- Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\)
- Parallel machine scheduling with job assignment restrictions
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Production, maintenance and resource scheduling: a review
- Scheduling parallel machines with inclusive processing set restrictions
- Set Partitioning: A survey
Cited in
(9)- Green scheduling with time-of-use tariffs and machine states: optimizing energy cost via branch-and-bound and bin packing strategies
- Bilevel adversarial scheduling problem on parallel machines
- The generalized assignment problem with fixed processing times and uniform processing costs to minimize total cost
- A bi-objective unrelated parallel machine scheduling problem with additional resources and soft precedence constraints
- Bilinear branch and check for unspecified parallel machine scheduling with shift consideration
- Generalized last open-end bin packing problem
- Approximation algorithms for scheduling with rejection in Green manufacturing
- The fourth comprehensive review of scheduling problems with setup times
- Exact and approximate algorithms for high-multiplicity scheduling with rejection on parallel machines
This page was built for publication: Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6556084)
