Journal
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
Volume -, Issue -, Pages -Publisher
WILEY
DOI: 10.1111/itor.13240
Keywords
coupled task scheduling; mixed-integer program; makespan minimization; binary search; relax-and-solve matheuristic; relax-and-solve
Funding
- UTS International Research Scholarship (IRS)
- UTS President's Scholarship (UTSP)
- Australian Research Council Discovery Early Career Researcher Award - Australian Government [DE170100234]
- Council of Australian University Librarians
- Australian Research Council [DE170100234] Funding Source: Australian Research Council
Ask authors/readers for more resources
This article proposes a new method for the general single machine coupled task scheduling problem and demonstrates its superiority in improving solution quality and reducing the average gap to the best known solution.
The general single machine coupled task scheduling problem with the objective function of minimizing the makespan, which is strongly NP-hard, aims to schedule a set of coupled task jobs on one machine such that the completion time of the last job is minimized. We propose a new mixed-integer program (MIP) for the problem. We also propose a relax-and-solve (R&S) matheuristic algorithm as the solution method. We show that the new MIP outperforms the available models and improves the quality of solutions. Also, the proposed MIP significantly improves the average gap to the best known feasible solution of an existing binary search algorithm. We show that our R&S matheuristic produces new best solutions for almost 50% of the instances.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available