Pages that link to "Item:Q1762161"
From MaRDI portal
The following pages link to A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times (Q1762161):
Displaying 17 items.
- Genetic tabu search for the fuzzy flexible job shop problem (Q337343) (← links)
- Evaluation of mathematical models for flexible job-shop scheduling problems (Q350406) (← links)
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
- A nonlinear formulation of piezoelectric shells with complete electro-mechanical coupling (Q904812) (← links)
- Group-shop scheduling with sequence-dependent set-up and transportation times (Q1634110) (← links)
- A variable neighborhood MOEA/D for multiobjective test task scheduling problem (Q1718350) (← links)
- A simulated multi-objective model for flexible job shop transportation scheduling (Q2150761) (← links)
- Integration of routing into a resource-constrained project scheduling problem (Q2175371) (← links)
- Joint production and transportation scheduling in flexible manufacturing systems (Q2274861) (← links)
- Flexible job shop scheduling problem for parallel batch processing machine with compatible job families (Q2290149) (← links)
- A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times (Q2668713) (← links)
- A hybrid multi-objective approach for real-time flexible production scheduling and rescheduling under dynamic environment in Industry 4.0 context (Q2668716) (← links)
- A research survey: review of flexible job shop scheduling techniques (Q2811943) (← links)
- Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen (Q6068710) (← links)
- A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation (Q6079857) (← links)
- Flexible job-shop scheduling with transportation resources (Q6087485) (← links)
- A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources (Q6106766) (← links)