Pages that link to "Item:Q2239940"
From MaRDI portal
The following pages link to Multiobjective optimization for complex flexible job-shop scheduling problems (Q2239940):
Displaying 19 items.
- A multi-objective production scheduling case study solved by simulated annealing (Q863984) (← links)
- Multiobjective joint optimization of production scheduling and maintenance planning in the flexible job-shop problem (Q1666440) (← links)
- A batch-oblivious approach for complex job-shop scheduling problems (Q1695012) (← links)
- An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria (Q2003434) (← links)
- A novel hybrid multi-objective algorithm to solve the generalized cubic cell formation problem (Q2108168) (← links)
- A simulated multi-objective model for flexible job shop transportation scheduling (Q2150761) (← links)
- Bi-objective short-term scheduling in a rolling horizon framework: a priori approaches with alternative operational objectives (Q2273666) (← links)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- Decentralised, multi-objective driven scheduling for reentrant shops: a conceptual development and a test case (Q2566702) (← links)
- Modeling and solving the flow-shop scheduling problem with sequence-dependent setup times by firefly algorithm (case study: automotive industry) (Q2676023) (← links)
- A multi-objective optimization method of flexible job-shop lot-splitting scheduling (Q2886120) (← links)
- From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective (Q3637390) (← links)
- A supervised method for scheduling multi-objective job shop systems in the presence of market uncertainties (Q5002286) (← links)
- Auction-based approach for a flexible job-shop scheduling problem with multiple process plans (Q5059253) (← links)
- A Taxonomy for the Flexible Job Shop Scheduling Problem (Q5270504) (← links)
- A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems (Q6096569) (← links)
- Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem (Q6106559) (← links)
- A study of deep learning neural network algorithms and genetic algorithms for FJSP (Q6535654) (← links)
- Solving a real-life multi-skill resource-constrained multi-project scheduling problem (Q6588468) (← links)