The coupled task scheduling problem : an improved mathematical program and a new solution algorithm
Year of publication: |
2024
|
---|---|
Authors: | Khatami, Mostafa ; Salehipour, Amir |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 31.2024, 4, p. 2399-2426
|
Subject: | binary search | coupled task scheduling | makespan minimization | mixed-integer program | relax-and-solve | relax-and-solve matheuristic | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Produktionsplanung | Production planning |
-
A binary search algorithm for the general coupled task scheduling problem
Khatami, Mostafa, (2021)
-
Decomposition methods for the parallel machine scheduling problem with setups
Tran, Tony T., (2016)
-
Jafarzadeh, Hassan, (2017)
- 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 ...