A comprehensive review and evaluation of permutation flowshop heuristics

Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs

This paper is a complete survey of flowshop-scheduling problems and contributions from early works of Johnson of 1954 to recent approaches of metaheuristics of 2004. It mainly considers a flowshop problem with a makespan criterion and it surveys some exact methods (for small size problems), constructive heuristics and developed improving metaheuristic and evolutionary approaches as well as some well-known properties and rules for this problem. Each part has a brief literature review of the contributions and a glimpse of that approach before discussing the implementation for a flowshop problem. Moreover, in the first section, a complete literature review of flowshop-related scheduling problems with different assumptions as well as contributions in solving these other aspects is considered. This paper can be seen as a reference to past contributions (particularly in n/m/p/c max or equivalently F/prmu/c max) for future research needs of improving and developing better approaches to flowshop-related schedulin...

/pdf/flowshop-scheduling-problems-with-makespan-criterion-a-213x25gw18.pdf

Flowshop-scheduling problems with makespan criterion: a review

A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal

Cloud computing has become an increasingly important research topic given the strong evolution and migration of many network services to such computational environment. The problem that arises is related with efficiency management and utilization of the large amounts of computing resources. This paper begins with a brief retrospect of traditional scheduling, followed by a detailed review of metaheuristic algorithms for solving the scheduling problems by placing them in a unified framework. Armed with these two technologies, this paper surveys the most recent literature about metaheuristic scheduling solutions for cloud. In addition to applications using metaheuristics, some important issues and open questions are presented for the reference of future researches on scheduling for cloud.

Mohammad A. Al-Fawzan

Papers

A tabu search approach for the flow shop scheduling problem