Liaw, C.F. (2003) An Efficient Tabu Search Approach for the Two-Machine Preemptive Open Shop Scheduling Problem. Computers and Operations Research, 30, 2081-2095.
http://dx.doi.org/10.1016/S0305-0548(02)00124-7

has been cited by the following article:

• TITLE: Literature Review of Open Shop Scheduling Problems

  AUTHORS: Ellur Anand, Ramasamy Panneerselvam

  KEYWORDS: Open Shop Scheduling, Measures of Performance, Meta-Heuristics, Heuristics

  JOURNAL NAME: Intelligent Information Management, Vol.7 No.1, January 28, 2015

  ABSTRACT: This paper discusses review of literature of open shop scheduling problems. First, the problem is classified as per different measures of performance, viz., minimization of makespan, minimization of sum of completion times of jobs, minimization of sum of weighted completion times of all jobs, minimization of total tardiness of all jobs, minimization of sum of weighted tardiness of all jobs, minimization of weighted sum of tardy jobs, and miscellaneous measures of the open shop scheduling problem. In each category, the literature is further classified based on approaches used and then the contributions of researchers in the respective categories are presented. Directions for future research are discussed in the end.