Pages that link to "Item:Q2284476"
From MaRDI portal
The following pages link to Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm (Q2284476):
Displayed 11 items.
- A simulated multi-objective model for flexible job shop transportation scheduling (Q2150761) (← links)
- Flexible job shop scheduling problem for parallel batch processing machine with compatible job families (Q2290149) (← links)
- An estimation of distribution algorithm for scheduling problem of flexible manufacturing systems using Petri nets (Q2295184) (← links)
- An uncertain programming model for single machine scheduling problem with batch delivery (Q2313751) (← links)
- A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times (Q2668713) (← links)
- Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters (Q2676401) (← links)
- A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time (Q6048213) (← links)
- Shop scheduling in manufacturing environments: a review (Q6060656) (← 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)
- An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints (Q6092532) (← links)
