A binary search algorithm for the general coupled task scheduling problem
Year of publication: |
2021
|
---|---|
Authors: | Khatami, Mostafa ; Salehipour, Amir |
Published in: |
4OR : quarterly journal of the Belgian, French and Italian Operations Research Societies. - Berlin : Springer, ISSN 1614-2411, ZDB-ID 2106212-2. - Vol. 19.2021, 4, p. 593-611
|
Subject: | Coupled task scheduling | Single machine | Minimizing makespan | Binary search | Heuristic | Bounds | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Algorithmus | Algorithm |
-
The coupled task scheduling problem : an improved mathematical program and a new solution algorithm
Khatami, Mostafa, (2024)
-
Decomposition methods for the parallel machine scheduling problem with setups
Tran, Tony T., (2016)
-
A solution technique for capacitated two-level hierarchical time minimization transportation problem
Ding, Hui, (2023)
- More ...
-
Four decades of research on the open-shop scheduling problem to minimize the makespan
Ahmadian, Mohammad Mahdi, (2021)
-
Coupled task scheduling with time-dependent processing times
Khatami, Mostafa, (2021)
-
Makespan minimization for the m-machine ordered flow shop scheduling problem
Khatami, Mostafa, (2019)
- More ...