Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
Year of publication: |
2022
|
---|---|
Authors: | Gao, Yuan ; Yuan, Jinjiang ; Ng, C. T. ; Cheng, T. C. E. |
Published in: |
4OR : quarterly journal of the Belgian, French and Italian Operations Research Societies. - Berlin : Springer, ISSN 1614-2411, ZDB-ID 2106212-2. - Vol. 20.2022, 2, p. 273-287
|
Subject: | family jobs | ND agents | parallel-batch machine | Pareto-scheduling | polynomial time | Durchlaufzeit | Lead time | Scheduling-Verfahren | Scheduling problem | Familie | Family | Theorie | Theory | Algorithmus | Algorithm |
-
Hybrid flowshop scheduling with family setup time and inconsistent family formation
Luo, Hao, (2012)
-
Online algorithms for scheduling two parallel machines with a single server
Jiang, Yiwei, (2015)
-
Local search heuristics for single machine tardiness sequencing
Crauwels, H. A., (1994)
- More ...
-
Gao, Yuan, (2019)
-
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
Li, Shisheng, (2011)
-
Fu, Ruyan, (2013)
- More ...