Optimizing job shop scheduling with speed-adjustable machines and peak power constraints: a mathematical model and heuristic solutions
From MaRDI portal
Cites work
- A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems
- A biased random-key genetic algorithm for the minimization of open stacks problem
- A biased random‐key genetic algorithm for the home health care problem
- A hybrid biased random key genetic algorithm approach for the unit commitment problem
- A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
- A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation
- A new hybrid genetic algorithm for job shop scheduling problem
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- A survey of job shop scheduling problem: the types and models
- Flow shop scheduling with peak power consumption constraints
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Job scheduling under time-of-use energy tariffs for sustainable manufacturing: a survey
- Performance indicators in multiobjective optimization
- Shop scheduling in manufacturing environments: a review
- Smart energy pricing for demand‐side management in renewable energy smart grids
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
- The schedule-sequencing problem
This page was built for publication: Optimizing job shop scheduling with speed-adjustable machines and peak power constraints: a mathematical model and heuristic solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609707)