Danyu Bai

Orcid: 0000-0002-7884-7012

According to our database1, Danyu Bai authored at least 26 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Sequencing a tri-criteria multiple job classes and customer orders problem on a single machine by using heuristics and simulated annealing method.
Oper. Res., March, 2024

Hybrid Flow Shop Scheduling With Learning Effects and Release Dates to Minimize the Makespan.
IEEE Trans. Syst. Man Cybern. Syst., January, 2024

Scheduling a multi-agent flow shop with two scenarios and release dates.
Int. J. Prod. Res., January, 2024

2023
Bicriteria single-machine scheduling with multiple job classes and customer orders.
Appl. Soft Comput., November, 2023

Scheduling non-permutation flowshop with finite buffers and two competitive agents.
Comput. Ind. Eng., March, 2023

Minimizing the total electricity cost and maximum lateness of the flow shop scheduling problem under time-of-use energy tariffs.
Proceedings of the IEEE International Conference on Networking, Sensing and Control, 2023

2022
Minimizing the sum of makespan on multi-agent single-machine scheduling with release dates.
Swarm Evol. Comput., 2022

Blocking flowshop scheduling problems with release dates.
Swarm Evol. Comput., 2022

Competitive bi-agent flowshop scheduling to minimise the weighted combination of makespans.
Int. J. Prod. Res., 2022

2021
Several variants of simulated annealing hyper-heuristic for a single-machine scheduling with two-scenario-based dependent processing times.
Swarm Evol. Comput., 2021

Minimization of maximum lateness in a flowshop learning effect scheduling with release dates.
Comput. Ind. Eng., 2021

2020
An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling.
Int. J. Prod. Res., 2020

Effective algorithms for single-machine learning-effect scheduling to minimize completion-time-based criteria with release dates.
Expert Syst. Appl., 2020

2019
Artificial bee colony algorithms for the order scheduling with release dates.
Soft Comput., 2019

A two-stage three-machine assembly scheduling flowshop problem with both two-agent and learning phenomenon.
Comput. Ind. Eng., 2019

2018
Particle-swarm Krill Herd Algorithm.
Proceedings of the 2018 IEEE International Conference on Industrial Engineering and Engineering Management, 2018

2017
Permutation flow shop scheduling problem to minimize nonlinear objective function with release dates.
Comput. Ind. Eng., 2017

2016
Flexible open shop scheduling problem to minimize makespan.
Comput. Oper. Res., 2016

Permutation flowshop group scheduling with position-based learning effect.
Comput. Ind. Eng., 2016

Two-Stage Flow-Open Shop Scheduling Problem to Minimize Makespan.
Proceedings of the Intelligent Computing Theories and Application, 2016

2015
Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates.
Int. J. Syst. Sci., 2015

2014
On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem.
Int. J. Syst. Sci., 2014

An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times.
Appl. Math. Comput., 2014

2011
Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan.
Int. J. Syst. Sci., 2011

2008
A New Machine Scheduling Problem with Temperature Loss.
Proceedings of the International Workshop on Knowledge Discovery and Data Mining, 2008

2007
Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem.
Proceedings of the Combinatorial Optimization and Applications, 2007


  Loading...