Four Decades of Research on the Open-Shop Scheduling Problem to Minimize the Make-span

30 Pages Posted: 29 Jun 2020

See all articles by Mohammad Mahdi Ahmadian

Mohammad Mahdi Ahmadian

University of Technology Sydney (UTS)

Mostafa Khatami

University of Technology Sydney (UTS)

Amir Salehipour

University of Technology Sydney (UTS)

T.C.E. Cheng

Hong Kong Polytechnic University - Faculty of Business

Date Written: May 15, 2020

Abstract

One of the basic scheduling problems, the open-shop scheduling problem has a broad range of applications across different sectors. The problem concerns scheduling a set of jobs, each of which has a set of operations, on a set of different machines. Each machine can process at most one operation at a time and the job processing order on the machines is immaterial, i.e., it has no implication for the scheduling outcome. The aim is to determine a schedule, i.e., the completion times of the operations processed on the machines, such that a performance criterion is optimized. While research on the problem dates back to the 1970s, there have been reviving interests in the computational complexity of variants of the problem and solution methodologies in the past few years. Aiming to provide a complete road map for future research on the open-shop scheduling problem, we present an up-to-date and comprehensive review of studies on the problem that focuses on minimizing the make-span, and discuss potential research opportunities.

Keywords: scheduling, open-shop, review, make-span

Suggested Citation

Ahmadian, Mohammad Mahdi and Khatami, Mostafa and Salehipour, Amir and Cheng, T.C.E., Four Decades of Research on the Open-Shop Scheduling Problem to Minimize the Make-span (May 15, 2020). Available at SSRN: https://ssrn.com/abstract=3619567 or http://dx.doi.org/10.2139/ssrn.3619567

Mohammad Mahdi Ahmadian

University of Technology Sydney (UTS) ( email )

15 Broadway, Ultimo
PO Box 123
Sydney, NSW 2007
Australia

Mostafa Khatami

University of Technology Sydney (UTS) ( email )

15 Broadway, Ultimo
PO Box 123
Sydney, NSW 2007
Australia

Amir Salehipour (Contact Author)

University of Technology Sydney (UTS) ( email )

15 Broadway, Ultimo
PO Box 123
Sydney, NSW 2007
Australia

T.C.E. Cheng

Hong Kong Polytechnic University - Faculty of Business ( email )

9/F, Li Ka Shing Tower
The Hong Kong Polytechnic University
Hong Kong, Hung Hom, Kowloon M923
China

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
52
Abstract Views
265
rank
460,493
PlumX Metrics