Pages that link to "Item:Q1296703"
From MaRDI portal
The following pages link to Benchmarks for shop scheduling problems (Q1296703):
Displaying 28 items.
- New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
- Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics (Q336577) (← links)
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop (Q339585) (← links)
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073) (← links)
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis (Q421447) (← links)
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley'' (Q707768) (← links)
- An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques (Q867431) (← links)
- On operators and search space topology in multi-objective flow shop scheduling (Q872256) (← links)
- A discrete version of particle swarm optimization for flowshop scheduling problems (Q878589) (← links)
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284) (← links)
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (Q1615940) (← links)
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025) (← links)
- An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem (Q2427185) (← links)
- An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)
- Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← links)
- Instance space analysis and algorithm selection for the job shop scheduling problem (Q2669728) (← links)
- FLOW SHOP SCHEDULING WITH REINFORCEMENT LEARNING (Q2868184) (← links)
- Parallel metaheuristics: recent advances and new trends (Q4921253) (← links)
- A spatial pyramid pooling-based deep reinforcement learning model for dynamic job-shop scheduling problem (Q6068734) (← links)
- Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach (Q6109307) (← links)
- Energy cost efficient scheduling in flexible job-shop manufacturing systems (Q6113446) (← links)
- Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling (Q6173707) (← links)
