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 | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Heuristik | Heuristics | Algorithmus | Algorithm | Durchlaufzeit | Lead time |
-
Single machine scheduling to maximize the number of on-time jobs with generalized due-dates
Gerstl, Enrique, (2020)
-
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)
- More ...
-
The Gradual Minimal Covering Location Problem
Khatami, Mostafa, (2020)
-
A Binary Search Method for the General Coupled Task Scheduling Problem
Khatami, Mostafa, (2019)
-
Optimal Makespan for the Coupled Task Ordered Flow-Shop
Khatami, Mostafa, (2020)
- More ...