I am the PhD candidate at the School of Mathematical and Physical Sciences. My main research interests are Operations Research and Optimization models and techniques. I am currently working on scheduling problems and their application to challenging real-world problems.
Khatami, M, Salehipour, A & Cheng, TCE 2020, 'Coupled task scheduling with exact delays: Literature review and models', European Journal of Operational Research, vol. 282, no. 1, pp. 19-39.View/Download from: Publisher's site
© 2019 Elsevier B.V. The coupled task scheduling problem concerns scheduling a set of jobs, each with at least two tasks and there is an exact delay period between two consecutive tasks, on a set of machines to optimize a performance criterion. While research on the problem dates back to the 1980s, interests in the computational complexity of variants of the problem and solution methodologies have been evolving in the past few years. This motivates us to present an up-to-date and comprehensive literature review on the topic. Aiming to provide a complete road map for future research on the coupled task scheduling problem, we discuss all the relevant studies and potential research opportunities. In addition, we propose several sets of benchmark instances for the problem in various settings and provide a detailed evaluation of all the available mathematical models with a view to facilitating future research on the solution methods.
Khatami, M, Salehipour, A & Hwang, FJ 2019, 'Makespan minimization for the m-machine ordered flow shop scheduling problem', Computers & Operations Research, vol. 111, pp. 400-414.View/Download from: Publisher's site
Khatami, M & Zegordi, SH 2017, 'Coordinative production and maintenance scheduling problem with flexible maintenance time intervals', JOURNAL OF INTELLIGENT MANUFACTURING, vol. 28, no. 4, pp. 857-867.View/Download from: Publisher's site
Khatami, M & Salehipour, A 2019, 'A simple heuristic for the coupled task scheduling problem', 23rd International Congress on Modelling and Simulation - Supporting Evidence-Based Decision Making: The Role of Modelling and Simulation, MODSIM 2019, pp. 312-318.
Copyright © 2019 The Modelling and Simulation Society of Australia and New Zealand Inc. All rights reserved. The coupled task scheduling problem deals with the problem of scheduling a set of jobs to be processed on a single machine. Each job consists of two separated tasks where the second task of a job must be started after the completion of its first task plus a predefined exact delay ti me. We study the coupled task scheduling problem with the objective of minimising the maximum completion time, i.e., the makespan. The problem is known to be strongly NP-hard. We propose a simple heuristic for the problem. The heuristic sets the midpoint of given lower and upper bounds as a makespan and solves a feasibility problem. Upon solving the feasibility problem the upper bound is updated to the midpoint. Otherwise, the lower bound is updated to the midpoint. The algorithm keeps iterating until the bound interval is zero. Computational experiments indicate that the proposed heuristic outperforms the exact solver.