This paper proposes the use of genetic algorithms (GAs) for storage and retrieval sequencing in an automated storage and retrieval system that is integrated with machines. Further, it addresses the sequencing when several requests are available and a dual command cycle is performed. The proposed approach is compared with storage and retrieval heuristics such as random, first come first served, and nearest neighbour heuristics. GA rule as machine scheduling is compared with shortest processing time, most work remaining, least operations remaining, least processing time, least work remaining, most operations remaining and random. Case studies demonstrate the effectiveness of the approach.